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

DOI10.1137/09074989XzbMath1223.05129OpenAlexW1966546617MaRDI QIDQ3008023

József Balogh, Wojciech Samotij

Publication date: 17 June 2011

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

Full work available at URL: https://doi.org/10.1137/09074989x

zbMATH Keywords

extremal graphsTurán's problem\(C_4\)-freeasymptotic graph enumerationasymptotic graph structure

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (4)

The number of \(C_{2\ell}\)-free graphs ⋮ The fine structure of octahedron-free graphs ⋮ The number of \(K_{m,m}\)-free graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems

This page was built for publication: Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges