The Turn Theorem for Random Graphs

DOI10.1017/S0963548303005856zbMath1048.05075OpenAlexW2133242543WikidataQ97694860 ScholiaQ97694860MaRDI QIDQ4813867

Yoshiharu Kohayakawa, Vojtěch Rödl, Mathias Schacht

Publication date: 7 September 2004

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548303005856

zbMATH Keywords

chromatic numberBernoulli graphextremal subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75)

Related Items (16)

Extremal subgraphs of random graphs ⋮ Embedding graphs with bounded degree in sparse pseudorandom graphs ⋮ 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 theorem for pseudo-random graphs ⋮ On an anti-Ramsey threshold for random graphs ⋮ Simple Containers for Simple Hypergraphs ⋮ On the KŁR conjecture in random graphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ \(K_4\)-free subgraphs of random graphs revisited ⋮ Turánnical hypergraphs ⋮ A note on counting orientations ⋮ On an anti-Ramsey property of random graphs ⋮ Independent sets in hypergraphs

This page was built for publication: The Turn Theorem for Random Graphs