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

DOI10.1016/J.DISC.2013.04.024MaRDI QIDQ389980zbMATH OpenOpenAlexWikidataFDO

Authors 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) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• On the Erdős-Sós conjecture for graphs on \(n=k+3\) vertices.
• On the Erdős-Sós conjecture for graphs on \(n = k + 4\) vertices
• On the Erdős-Sós conjecture for graphs with circumference at most \(k\)
• On Erdős-Sós conjecture for trees of large size
• On the Erd�s-S�s conjecture

Cites work

• scientific article; zbMATH DE number 3885926 (Why is no real title available?)
• scientific article; zbMATH DE number 1792598 (Why is no real title available?)
• Asymptotic solution for a new class of forbidden r-graphs
• Constructing Trees in Graphs whose Complement has no K_2,s
• Constructing trees in graphs with no K_2,s
• On maximal paths and circuits of graphs
• On the Erdős-Sós conjecture and graphs with large minimum degree.
• On the Erdős-Sós conjecture for graphs on \(n=k+3\) vertices.
• On the Erd�s-S�s conjecture
• Packing a tree with a graph of the same size
• The Erdös-Sós conjecture for graphs of girth 5
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdős‐Sós Conjecture for trees of diameter four
• Tree embeddings

Cited in

(8)

• The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)
• On the Erdős-Sós conjecture for graphs on \(n=k+3\) vertices.
• scientific article; zbMATH DE number 6940851 (Why is no real title available?)
• An \(A_{\alpha}\)-spectral Erdős-Sós theorem
• On Erdős-Sós conjecture for trees of large size
• On the Erdős-Sós conjecture for graphs with circumference at most \(k+1\)
• On the Erdős-Sós conjecture for graphs with circumference at most \(k\)
• On the Erdős-Sós conjecture for graphs on \(n = k + 4\) vertices

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

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