On the double competition number

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

It is known, that for almost all n-vertex simple graphs one needs Ω(n4 3(log n) 4 3) extra vertices to obtain them as a double competition graph of a digraph. In this note a construction is given to show that 2n4 3 are always sufficient.

Original languageEnglish
Pages (from-to)251-255
Number of pages5
JournalDiscrete Applied Mathematics
Volume82
Issue number1-3
DOIs
Publication statusPublished - Mar 2 1998

    Fingerprint

Keywords

  • Clique covers
  • Competition graphs
  • Random graphs

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this