Competition graphs and clique dimensions

DOI10.1002/rsa.3240010205zbMath0764.05091OpenAlexW1978015728MaRDI QIDQ3977074

Zoltan Fueredi

Publication date: 25 June 1992

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240010205

zbMATH Keywords

competition graphsimple graphsclique dimensions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items

Two-\(\phi\)-tolerance competition graphs ⋮ On the double competition number ⋮ On CCE graphs of doubly partial orders ⋮ Kneser Ranks of Random Graphs and Minimum Difference Representations ⋮ Tolerance competition graphs ⋮ \(p\)-competition graphs ⋮ Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two ⋮ The \(m\)-step competition graph of a digraph

Cites Work

• The competition-common enemy graph of a digraph
• The Representation of a Graph by Set Intersections
• Unnamed Item