On the Number of Graphs Without Large Cliques

DOI10.1137/130947878zbMath1309.05101arXiv1312.1143OpenAlexW1971123962MaRDI QIDQ5246099

Frank Mousset, Rajko Nenadov, Angelika Steger

Publication date: 17 April 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1143

zbMATH Keywords

clique-free graphsasymptotic counting

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ The typical structure of graphs with no large cliques ⋮ An efficient container lemma

This page was built for publication: On the Number of Graphs Without Large Cliques