Competition graphs and clique dimensions

DOI10.1002/RSA.3240010205MaRDI QIDQ3977074zbMATH OpenOpenAlexFDO

Authors Zoltán Füredi

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

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

Recommendations

• On the double competition number
• Competition numbers of graphs with a small number of triangles
• Publication:3474667
• On the inequality \(dk(G)\leq k(G)+1\)
• scientific article; zbMATH DE number 6009

Cites work

• scientific article; zbMATH DE number 3912431 (Why is no real title available?)
• The Representation of a Graph by Set Intersections
• The competition-common enemy graph of a digraph

Cited in

(10)

• Kneser ranks of random graphs and minimum difference representations
• On the double competition number
• A mathematical approach on representation of competitions: competition cluster hypergraphs
• On CCE graphs of doubly partial orders
• \(p\)-competition graphs
• Two-\(\phi\)-tolerance competition graphs
• Tolerance competition graphs
• The \(m\)-step competition graph of a digraph
• Competition parameters of a graph
• Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two

This page was built for publication: Competition graphs and clique dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977074)