Turán's theorem for pseudo-random graphs

DOI10.1016/j.jcta.2006.08.004zbMath1120.05084MaRDI QIDQ880006

Vojtěch Rödl, Mathias Schacht, Yoshiharu Kohayakawa, Jozef Skokan, Papa Amar Sissokho

Publication date: 10 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2006.08.004

zbMATH Keywords

regularity lemma; pseudo-randomness; Turán's theorem; \((n; \lambda )\)-graphs; d

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

Related Items

Turán's theorem for pseudo-random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangle factors in sparse pseudo-random graphs
• Turán's theorem for pseudo-random graphs
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• An extremal problem for random graphs and the number of graphs with large even-girth
• Random Ramsey graphs for the four-cycle
• Explicit Ramsey graphs and orthonormal labelings
• On \(K^ 4\)-free subgraphs of random graphs
• Embedding graphs with bounded degree in sparse pseudorandom graphs
• Cutting a graph into two dissimilar halves
• Subgraphs of a hypercube containing no small even cycles
• Szemerédi’s Regularity Lemma for Sparse Graphs
• Regular pairs in sparse random graphs I
• Extremal subgraphs of random graphs
• The Turn Theorem for Random Graphs
• The Induced Size-Ramsey Number of Cycles
• A generalization of Turán's theorem
• Imbalances in k‐colorations
• A Spectral Turán Theorem
• On the structure of linear graphs
• Quasi-random graphs