Competition graphs and clique dimensions

Research output: Contribution to journalArticle

10 Citations (Scopus)


Here it is proved that for almost all simple graphs over n vertices one needs Ω(n4/3(log n)−4/3) extra vertices to obtain them as a double competition graph of a digraph. on the other hand O(n5/3) extra vertices are always sufficient. Several problems remain open.

Original languageEnglish
Pages (from-to)183-189
Number of pages7
JournalRandom Structures & Algorithms
Issue number2
Publication statusPublished - 1990


ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics

Cite this