Competition graphs and clique dimensions

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

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
Volume1
Issue number2
DOIs
Publication statusPublished - 1990

Fingerprint

Competition Graph
Simple Graph
Clique
Digraph
Open Problems
Sufficient

ASJC Scopus subject areas

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

Cite this

Competition graphs and clique dimensions. / Füredi, Z.

In: Random Structures & Algorithms, Vol. 1, No. 2, 1990, p. 183-189.

Research output: Contribution to journalArticle

@article{d29e418404864fb5897b69401f8ef523,
title = "Competition graphs and clique dimensions",
abstract = "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.",
author = "Z. F{\"u}redi",
year = "1990",
doi = "10.1002/rsa.3240010205",
language = "English",
volume = "1",
pages = "183--189",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "2",

}

TY - JOUR

T1 - Competition graphs and clique dimensions

AU - Füredi, Z.

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84990709436&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990709436&partnerID=8YFLogxK

U2 - 10.1002/rsa.3240010205

DO - 10.1002/rsa.3240010205

M3 - Article

AN - SCOPUS:84990709436

VL - 1

SP - 183

EP - 189

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 2

ER -