The Erdős‐Sós Conjecture for trees of diameter four
From MaRDI portal
Publication:5311919
DOI10.1002/jgt.20083zbMath1068.05035OpenAlexW4252348807WikidataQ123366916 ScholiaQ123366916MaRDI QIDQ5311919
Publication date: 29 August 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20083
Related Items (19)
On Erdős-Sós conjecture for trees of large size ⋮ Gaps in the saturation spectrum of trees ⋮ On fan-wheel and tree-wheel Ramsey numbers ⋮ Embedding trees in graphs with independence number two ⋮ An Erdős-Gallai-type theorem for keyrings ⋮ On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices ⋮ A Spectral Erdős-Sós Theorem ⋮ Edges Not Covered by Monochromatic Bipartite Graph ⋮ Spectral radius conditions for the existence of all subtrees of diameter at most four ⋮ An \(A_{\alpha}\)-spectral Erdős-Sós theorem ⋮ A Local Approach to the Erdös--Sós Conjecture ⋮ An Erdős-Gallai type theorem for vertex colored graphs ⋮ A sufficient degree condition for a graph to contain all trees of size \(k\) ⋮ A variation of the Erdős-Sós conjecture in bipartite graphs ⋮ Hypergraphs Not Containing a Tight Tree with a Bounded Trunk ⋮ Turán Numbers of Multiple Paths and Equibipartite Forests ⋮ The spectral radius of graphs without trees of diameter at most four ⋮ Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs ⋮ On the Erdős-Sós conjecture for graphs with circumference at most \(k+1\)
This page was built for publication: The Erdős‐Sós Conjecture for trees of diameter four
