On the Erd�s-S�s conjecture

From MaRDI portal
Publication:4865531

DOI<229::AID-JGT13>3.0.CO;2-E 10.1002/(SICI)1097-0118(199602)21:2<229::AID-JGT13>3.0.CO;2-EzbMath0841.05017OpenAlexW2614633697MaRDI QIDQ4865531

Mariusz Woźniak

Publication date: 25 February 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2<229::aid-jgt13>3.0.co;2-e




Related Items (27)

On Erdős-Sós conjecture for trees of large sizeThe Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)On fan-wheel and tree-wheel Ramsey numbersRAMSEY NUMBERS FOR TREESRamsey-nice families of graphsOn graphs which contain each tree of given sizeThe Erdös-Sós conjecture for graphs without \(C_ 4\)Tree embeddingsAn Erdős-Gallai-type theorem for keyringsOn the Erdős-Sós conjecture for graphs having no path with \(k+4\) verticesThe Erdős-Sós conjecture for spiders of large sizeA Spectral Erdős-Sós TheoremAn \(A_{\alpha}\)-spectral Erdős-Sós theoremA Local Approach to the Erdös--Sós ConjectureAn approximate version of the Loebl-Komlós-Sós conjectureLong paths with endpoints in given vertex-subsets of graphsThe 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 graphsTurán Numbers of Multiple Paths and Equibipartite ForestsA variation of a conjecture due to Erdös and SósOn the Erdős-Sós conjecture for graphs with circumference at most \(k+1\)Local and mean Ramsey numbers for treesOn a conjecture about trees in graphs with large girthThe Approximate Loebl--Komlós--Sós Conjecture I: The Sparse DecompositionThe approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs




This page was built for publication: On the Erd�s-S�s conjecture