On the Erdős-Sós conjecture for graphs with circumference at most \(k+1\)

DOI10.1007/978-3-031-05375-7_17zbMath1500.05054OpenAlexW4295836666MaRDI QIDQ2089550

A. M. Heissan, Gary Tiner

Publication date: 22 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05375-7_17

zbMATH Keywords

embeddingaverage degree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Cites Work

• On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices
• Packing a tree with a graph of the same size
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]
• The Erdős‐Sós Conjecture for trees of diameter four
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Erdős-Sós conjecture for graphs with circumference at most \(k+1\)