The Erdös-Sós conjecture for graphs without \(C_ 4\)
From MaRDI portal
Publication:1362105
DOI10.1006/jctb.1997.1758zbMath0878.05024OpenAlexW2032025600MaRDI QIDQ1362105
Mariusz Woźniak, Jean-François Saclé
Publication date: 12 August 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1997.1758
Related Items
On Erdős-Sós conjecture for trees of large size ⋮ The Erdős-Sós conjecture for graphs whose complements contain no \(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 ⋮ 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 ⋮ 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 variation of the Erdős-Sós conjecture in bipartite graphs ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ Turán Numbers of Multiple Paths and Equibipartite Forests ⋮ A variation of a conjecture due to Erdös and Sós ⋮ Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs ⋮ 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
Cites Work
