Turán's theorem in sparse random graphs

DOI10.1002/RSA.10088zbMATH Open1028.05101DBLPjournals/rsa/SzaboV03OpenAlexW2000630511WikidataQ97694876 ScholiaQ97694876MaRDI QIDQ4431433FDOQ4431433

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

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

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)

Cites Work

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

Cited In (14)

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

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)