Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges

DOI10.1137/09074989XzbMath1223.05129MaRDI QIDQ3008023

József Balogh, Wojciech Samotij

Publication date: 17 June 2011

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

zbMATH Keywords

extremal graphs; Turán's problem; \(C_4\)-free; asymptotic graph enumeration; asymptotic graph structure

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C30: Enumeration in graph theory

05A16: Asymptotic enumeration

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)