Turán's theorem in sparse random graphs

DOI10.1002/rsa.10088zbMath1028.05101OpenAlexW2000630511WikidataQ97694876 ScholiaQ97694876MaRDI QIDQ4431433

Van H. Vu, Tibor Szabó

Publication date: 22 October 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10088

zbMATH Keywords

random graphextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

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 ⋮ Simple Containers for Simple Hypergraphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Erdős–Ko–Rado in Random Hypergraphs ⋮ \(K_4\)-free subgraphs of random graphs revisited ⋮ Independent sets in hypergraphs

Cites Work

• Turán's extremal problem in random graphs: Forbidding even cycles
• Asymptotically good list-colorings
• Turán's extremal problem in random graphs: Forbidding odd cycles