Turán's extremal problem in random graphs: Forbidding even cycles

DOI10.1006/jctb.1995.1035zbMath0828.05056OpenAlexW2029810714WikidataQ97694827 ScholiaQ97694827MaRDI QIDQ1898722

Tomasz Łuczak, Yoshiharu Kohayakawa, Penny E. Haxell

Publication date: 18 December 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1035

zbMATH Keywords

cyclerandom graphsparse graphsTurán's extremal problemSzemerédi's lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Related Items (21)

The number of \(C_{2\ell}\)-free graphs ⋮ Dirac's theorem for random graphs ⋮ Sandwiching random graphs: universality between random graph models ⋮ Small subsets inherit sparse \(\varepsilon\)-regularity ⋮ A new proof of the KŁR conjecture ⋮ Extremal results for random discrete structures ⋮ Combinatorial theorems in sparse random sets ⋮ Turán's extremal problem in random graphs: Forbidding odd cycles ⋮ On \(K^ 4\)-free subgraphs of random graphs ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Extremal results in sparse pseudorandom graphs ⋮ The number of \(K_{m,m}\)-free graphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Extremal results for odd cycles in sparse pseudorandom graphs ⋮ \(K_4\)-free subgraphs of random graphs revisited ⋮ Hypergraph containers ⋮ Stability results for random discrete structures ⋮ Regular pairs in sparse random graphs I ⋮ Turán's theorem in sparse random graphs ⋮ Independent sets in hypergraphs

This page was built for publication: Turán's extremal problem in random graphs: Forbidding even cycles