The Erdös-Sós conjecture for graphs of girth 5
From MaRDI portal
Publication:1916132
DOI10.1016/0012-365X(95)00207-DzbMATH Open0854.05064WikidataQ122964833 ScholiaQ122964833MaRDI QIDQ1916132
Publication date: 5 January 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
Related Items (31)
On the Erdős–Sós conjecture for trees with bounded degree ⋮ The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\) ⋮ On graphs which contain each tree of given size ⋮ The Erdös-Sós conjecture for graphs without \(C_ 4\) ⋮ Embedding trees in graphs with independence number two ⋮ Tree embeddings ⋮ On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices ⋮ Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ A Spectral Erdős-Sós Theorem ⋮ Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result ⋮ Maximum and Minimum Degree Conditions for Embedding Trees ⋮ A Local Approach to the Erdös--Sós Conjecture ⋮ An approximate version of the Loebl-Komlós-Sós conjecture ⋮ Long paths with endpoints in given vertex-subsets of graphs ⋮ The Erdős-Sós conjecture for spiders ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4506067 On the Loebl-Koml�s-S�s conjecture] ⋮ A sufficient degree condition for a graph to contain all trees of size \(k\) ⋮ A randomized embedding algorithm for trees ⋮ A variation of the Erdős-Sós conjecture in bipartite graphs ⋮ How connectivity affects the extremal number of trees ⋮ Embedding trees with maximum and minimum degree conditions ⋮ The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ Degree Conditions for Embedding Trees ⋮ Improving bounds on the order of regular graphs of girth 5 ⋮ Turán Numbers of Multiple Paths and Equibipartite Forests ⋮ A variation of a conjecture due to Erdös and Sós ⋮ Local and mean Ramsey numbers for trees ⋮ On a conjecture about trees in graphs with large girth ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition ⋮ The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
This page was built for publication: The Erdös-Sós conjecture for graphs of girth 5
