On the structure of clique-free graphs

DOI10.1002/rsa.1017zbMath0989.05107OpenAlexW2041133760MaRDI QIDQ2748425

Thomas Schickinger, Angelika Steger, Hans Jürgen Prömel

Publication date: 14 October 2001

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

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

zbMATH Keywords

bipartite graphstriangle-free graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (1)

Almost every 2-SAT function is unate

Cites Work

• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Asymptotic Enumeration of Partial Orders on a Finite Set
• On the Structure of Edge Graphs
• Asymptotic enumeration, global structure, and constrained evolution

This page was built for publication: On the structure of clique-free graphs