Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem

DOI10.1006/jctb.2001.2097zbMath1019.05033arXivmath/0612838OpenAlexW2521427077MaRDI QIDQ1850610

Yoshiyasu Ishigami

Publication date: 10 December 2002

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

Full work available at URL: https://arxiv.org/abs/math/0612838

zbMATH Keywords

Turán numbersErdős-Stone theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (5)

Linear Ramsey Numbers for Bounded-Degree Hypergrahps ⋮ Ramsey non-goodness involving books ⋮ A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs ⋮ Tight bounds for powers of Hamilton cycles in tournaments ⋮ Almost-spanning subgraphs with bounded degree in dense graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ramsey number of a graph with bounded maximum degree
• An extension of the Erdős-Stone theorem
• Blow-up lemma
• Notes on the Erdös-Stone Theorem
• On the Erdös-Stone Theorem
• On the Structure of Edge Graphs II
• The Algorithmic Aspects of the Regularity Lemma
• On the Structure of Edge Graphs
• On a problem of K. Zarankiewicz
• On the structure of linear graphs

This page was built for publication: Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem