On the Erdős-Sós conjecture for graphs having no path with k+4 vertices
From MaRDI portal
Publication:389980
DOI10.1016/J.DISC.2013.04.024zbMATH Open1281.05047OpenAlexW1974491595WikidataQ123153012 ScholiaQ123153012MaRDI QIDQ389980FDOQ389980
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
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
- 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 K2,s
- On maximal paths and circuits of graphs
- On the Erd�s-S�s conjecture
- On the Erdős-Sós conjecture for graphs on \(n=k+3\) vertices.
- Title not available (Why is that?)
- Packing a tree with a graph of the same size
- The Erdős‐Sós Conjecture for trees of diameter four
- Constructing trees in graphs with no K2,s
- Asymptotic solution for a new class of forbidden r-graphs
- On the Erdős-Sós conjecture and graphs with large minimum degree.
- Title not available (Why is that?)
Cited In (8)
- 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
- The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)
- On Erdős-Sós conjecture for trees of large size
- On the Erdős-Sós conjecture for graphs on \(n=k+3\) vertices.
- Title not available (Why is that?)
- An \(A_{\alpha}\)-spectral Erdős-Sós theorem
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)
