Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs

DOI10.1016/j.disc.2009.05.030zbMath1184.05067OpenAlexW2094002291WikidataQ122981846 ScholiaQ122981846MaRDI QIDQ1045015

Oliver Cooley

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.030

zbMATH Keywords

embeddingLoebl-Komlós-Sós conjectureregularity LemmaRamsey numbers of trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (12)

Embedding trees in graphs with independence number two ⋮ Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ A version of the Loebl-Komlós-Sós conjecture for skew trees ⋮ A skew version of the Loebl-Komlós-Sós conjecture ⋮ Loebl-Komlós-Sós conjecture: dense case ⋮ Maximum and Minimum Degree Conditions for Embedding Trees ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A Local Approach to the Erdös--Sós Conjecture ⋮ Loebl-Komlós-Sós Conjecture: dense case ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition ⋮ The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs ⋮ The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Komlós conjecture for graphs of girth 7
• Constructing Trees in Graphs whose Complement has no K_2,s
• [https://portal.mardi4nfdi.de/wiki/Publication:4506067 On the Loebl-Koml�s-S�s conjecture]
• The Erdős‐Sós Conjecture for trees of diameter four
• An approximate version of the Loebl-Komlós-Sós conjecture

This page was built for publication: Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs