Asymptotic enumeration and a 0-1 law for $m$-clique free graphs

DOI10.1090/S0273-0979-1985-15403-5zbMath0584.05041WikidataQ114848716 ScholiaQ114848716MaRDI QIDQ3708834

Hans Jürgen Prömel, Bruce L. Rothschild, Phokion G. Kolaitis

Publication date: 1985

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

random graphsasymptotic enumerationchromatic numberasymptotic probability

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Related Items

Counting unlabeled structures, Hypergraphs with many Kneser colorings, On Colourings of Hypergraphs Without Monochromatic Fano Planes, Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs

Cites Work

• A logical approach to asymptotic combinatorics I. First order properties
• Countable Ultrahomogeneous Undirected Graphs
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Probabilities on finite models
• Universal graphs and universal functions