Notes on the Erdös-Stone Theorem

DOI10.1016/S0304-0208(08)73386-3MaRDI QIDQ3674705zbMATH OpenOpenAlexFDO

Authors

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)

Cited in

(2)

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

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

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