The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result

DOI10.1137/140982878zbMath1365.05144arXiv1408.3870OpenAlexW3106396105WikidataQ122927267 ScholiaQ122927267MaRDI QIDQ5267995

János Komlós, Jan Hladký, Endre Szemerédi, Diana Piguet, Maya Jakobine Stein, Miklós Simmonovits

Publication date: 14 June 2017

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

Full work available at URL: https://arxiv.org/abs/1408.3870

zbMATH Keywords

treeregularity lemmagraph decompositionextremal graph theoryLoebl-Komlós-Sós conjecturesparse graph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)

Related Items

On the Erdős–Sós conjecture for trees with bounded degree, Gaps in the saturation spectrum of trees, A version of the Loebl-Komlós-Sós conjecture for skew trees, A skew version of the Loebl-Komlós-Sós conjecture, Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result, Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result, 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, 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 III: The Finer Structure of LKS Graphs, The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result, The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
• Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
• Loebl-Komlós-Sós conjecture: dense case
• The Algorithmic Aspects of the Regularity Lemma
• 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 III: The Finer Structure of LKS Graphs
• The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result
• An approximate version of the Loebl-Komlós-Sós conjecture