An extremal result for subgraphs with few edges

DOI10.1006/JCTB.1995.1036zbMath0833.05049OpenAlexW2015093802MaRDI QIDQ1898723

Stephan Brandt

Publication date: 11 March 1996

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

Full work available at URL: https://doi.org/10.1006/jctb.1995.1036

zbMATH Keywords

complete graphforestTurán's theoremedge number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Packing large trees of consecutive orders ⋮ Packing of graphs with small product of sizes

This page was built for publication: An extremal result for subgraphs with few edges