On the Loebl-Koml�s-S�s conjecture

DOI<269::AID-JGT3>3.0.CO;2-Y 10.1002/1097-0118(200008)34:4<269::AID-JGT3>3.0.CO;2-YzbMath0958.05028OpenAlexW4235260866MaRDI QIDQ4506067

Mariusz Woźniak, Hao Li, Cristina Bazgan

Publication date: 10 April 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200008)34:4<269::aid-jgt3>3.0.co;2-y

zbMATH Keywords

treepathsLoebl-Komlós-Sós conjecture

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items

Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles ⋮ Embedding trees in graphs with independence number two ⋮ Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ Loebl-Komlós-Sós conjecture: dense case ⋮ A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture ⋮ An approximate version of the Loebl-Komlós-Sós conjecture ⋮ Long paths with endpoints in given vertex-subsets of graphs ⋮ Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs ⋮ 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

• Hamiltonian circuits in random graphs
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdös-Sós conjecture for graphs of girth 5
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]