Turán's theorem in sparse random graphs

DOI10.1002/RSA.10088MaRDI QIDQ4431433zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Tibor Szabó, Van Vu

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

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

Recommendations

• Extremal results in random graphs
• Combinatorial theorems in sparse random sets
• On \(K^ 4\)-free subgraphs of random graphs
• Extremal subgraphs of random graphs
• Turánnical hypergraphs

Cites work

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

Cited in

(15)

• Small subsets inherit sparse \(\varepsilon\)-regularity
• Turán's graph theorem, measures and probability theory
• Simple containers for simple hypergraphs
• A generalized Turán problem in random graphs
• Erdős-Ko-Rado in random hypergraphs
• Independent sets in hypergraphs
• Random polynomial graphs for random Turán problems
• \(K_4\)-free subgraphs of random graphs revisited
• Extremal results in random graphs
• A Spectral Turán Theorem
• Combinatorial theorems in sparse random sets
• Extremal results for random discrete structures
• Turán's extremal problem in random graphs: Forbidding even cycles
• A new proof of the KŁR conjecture
• An analogue of the Erdős-Gallai theorem for random graphs

This page was built for publication: Turán's theorem in sparse random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4431433)