Notes on the Erdös-Stone Theorem

DOI10.1016/S0304-0208(08)73386-3zbMath0523.05043OpenAlexW1182066779MaRDI QIDQ3674705

No author found.

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73386-3

zbMATH Keywords

forbidden subgraphcomplete (d+1)-partite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem ⋮ Tight bounds for powers of Hamilton cycles in tournaments

This page was built for publication: Notes on the Erdös-Stone Theorem