On Erdős-Sós conjecture for trees of large size
From MaRDI portal
Publication:276193
zbMath1335.05093MaRDI QIDQ276193
Agnieszka Goerlich, Andrzej Żak
Publication date: 3 May 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p52
Related Items (6)
On the Erdős–Sós conjecture for trees with bounded degree ⋮ A Spectral Erdős-Sós Theorem ⋮ An \(A_{\alpha}\)-spectral Erdős-Sós theorem ⋮ Maximum and Minimum Degree Conditions for Embedding Trees ⋮ A Local Approach to the Erdös--Sós Conjecture ⋮ Degree Conditions for Embedding Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices
- The Turán number of sparse spanning graphs
- Asymptotic solution for a new class of forbidden r-graphs
- Packing trees in complete graphs
- The Erdös-Sós conjecture for graphs without \(C_ 4\)
- The Erdős-Sós conjecture for spiders
- Constructing Trees in Graphs whose Complement has no K2,s
- 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
- On the Tree Packing Conjecture
- Constructing trees in graphs with no K2,s
This page was built for publication: On Erdős-Sós conjecture for trees of large size