On the double competition number

DOI10.1016/S0166-218X(97)00117-0zbMath0903.05031OpenAlexW2019846313MaRDI QIDQ1383383

Zoltan Fueredi

Publication date: 13 April 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

digraphrandom graphsdouble competition graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two

Cites Work

• Covering the edges of a random graph by cliques
• Clique coverings of the edges of a random graph
• Competition graphs and clique dimensions
• The Representation of a Graph by Set Intersections
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the double competition number