On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices

DOI10.1016/j.disc.2013.04.024zbMath1281.05047OpenAlexW1974491595WikidataQ123153012 ScholiaQ123153012MaRDI QIDQ389980

Nancy Eaton, Gary Tiner

Publication date: 22 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.04.024

zbMATH Keywords

treeembeddingErdős-Sós conjecture

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

On Erdős-Sós conjecture for trees of large size ⋮ An \(A_{\alpha}\)-spectral Erdős-Sós theorem ⋮ On the Erdős-Sós conjecture for graphs with circumference at most \(k+1\)

Cites Work

• Asymptotic solution for a new class of forbidden r-graphs
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdös-Sós conjecture for graphs of girth 5
• Tree embeddings
• Constructing Trees in Graphs whose Complement has no K_2,s
• On maximal paths and circuits of graphs
• 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
• Constructing trees in graphs with no K_2,s
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices