The approximate Loebl-Komlos-Sos conjecture and embedding trees in sparse graphs

Abstract

Loebl, Komlós and Sós conjectured that every $n$-vertex graph $G$ with at least $n/2$ vertices of degree at least $k$ contains each tree $T$ of order $k+1$ as a subgraph. We give a sketch of a proof of the approximate version of this conjecture for large values of $k$. For our proof, we use a structural decomposition which can be seen as an analogue of Szemerédi's regularity lemma for possibly very sparse graphs. With this tool, each graph can be decomposed into four parts: a set of vertices of huge degree, regular pairs (in the sense of the regularity lemma), and two other objects each exhibiting certain expansion properties. We then exploit the properties of each of the parts of $G$ to embed a given tree $T$. The purpose of this note is to highlight the key steps of our proof. Details can be found in [arXiv:1211.3050].

References in corpus (6)

• 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 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
• The Loebl-Komlos-Sos conjecture for trees of diameter 5 and for certain caterpillars