The approximate Loebl-Komlós-Sós conjecture I: The sparse decomposition

Jan Hladký, János Komlós, Diana Piguet, M. Simonovits, Maya Stein, E. Szemerédi

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

In a series of four papers we prove the following relaxation of the Loebl-Komlós-Sós conjecture: For every α > 0 there exists a number k0 such that for every k > k0, every n-vertex graph G with at least (1/2 + α)n vertices of degree at least (1 + α)k contains each tree T of order k as a subgraph. The method to prove our result follows a strategy similar to approaches that employ the Szemerédi regularity lemma: We decompose the graph G, find a suitable combinatorial structure inside the decomposition, and then embed the tree T into G using this structure. Since for sparse graphs G, the decomposition given by the regularity lemma is not helpful, we use a more general decomposition technique. We show that each graph can be decomposed into vertices of huge degree, regular pairs (in the sense of the regularity lemma), and two other objects each exhibiting certain expansion properties. In this paper, we introduce this novel decomposition technique. In the three follow-up papers, we find a suitable combinatorial structure inside the decomposition, which we then use for embedding the tree.

Original languageEnglish
Pages (from-to)945-982
Number of pages38
JournalSIAM Journal on Discrete Mathematics
Volume31
Issue number2
DOIs
Publication statusPublished - Jan 1 2017

Fingerprint

Regularity Lemma
Decompose
Decomposition Techniques
Graph in graph theory
Sparse Graphs
Subgraph
Series
Vertex of a graph

Keywords

  • Extremal graph theory
  • Graph decomposition
  • Loebl-Komlós-Sós conjecture
  • Regularity lemma
  • Sparse graph
  • Tree embedding

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

The approximate Loebl-Komlós-Sós conjecture I : The sparse decomposition. / Hladký, Jan; Komlós, János; Piguet, Diana; Simonovits, M.; Stein, Maya; Szemerédi, E.

In: SIAM Journal on Discrete Mathematics, Vol. 31, No. 2, 01.01.2017, p. 945-982.

Research output: Contribution to journalArticle

Hladký, Jan ; Komlós, János ; Piguet, Diana ; Simonovits, M. ; Stein, Maya ; Szemerédi, E. / The approximate Loebl-Komlós-Sós conjecture I : The sparse decomposition. In: SIAM Journal on Discrete Mathematics. 2017 ; Vol. 31, No. 2. pp. 945-982.
@article{be8568f572f948bd93ed7ef50eb5a150,
title = "The approximate Loebl-Koml{\'o}s-S{\'o}s conjecture I: The sparse decomposition",
abstract = "In a series of four papers we prove the following relaxation of the Loebl-Koml{\'o}s-S{\'o}s conjecture: For every α > 0 there exists a number k0 such that for every k > k0, every n-vertex graph G with at least (1/2 + α)n vertices of degree at least (1 + α)k contains each tree T of order k as a subgraph. The method to prove our result follows a strategy similar to approaches that employ the Szemer{\'e}di regularity lemma: We decompose the graph G, find a suitable combinatorial structure inside the decomposition, and then embed the tree T into G using this structure. Since for sparse graphs G, the decomposition given by the regularity lemma is not helpful, we use a more general decomposition technique. We show that each graph can be decomposed into vertices of huge degree, regular pairs (in the sense of the regularity lemma), and two other objects each exhibiting certain expansion properties. In this paper, we introduce this novel decomposition technique. In the three follow-up papers, we find a suitable combinatorial structure inside the decomposition, which we then use for embedding the tree.",
keywords = "Extremal graph theory, Graph decomposition, Loebl-Koml{\'o}s-S{\'o}s conjecture, Regularity lemma, Sparse graph, Tree embedding",
author = "Jan Hladk{\'y} and J{\'a}nos Koml{\'o}s and Diana Piguet and M. Simonovits and Maya Stein and E. Szemer{\'e}di",
year = "2017",
month = "1",
day = "1",
doi = "10.1137/140982842",
language = "English",
volume = "31",
pages = "945--982",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "2",

}

TY - JOUR

T1 - The approximate Loebl-Komlós-Sós conjecture I

T2 - The sparse decomposition

AU - Hladký, Jan

AU - Komlós, János

AU - Piguet, Diana

AU - Simonovits, M.

AU - Stein, Maya

AU - Szemerédi, E.

PY - 2017/1/1

Y1 - 2017/1/1

N2 - In a series of four papers we prove the following relaxation of the Loebl-Komlós-Sós conjecture: For every α > 0 there exists a number k0 such that for every k > k0, every n-vertex graph G with at least (1/2 + α)n vertices of degree at least (1 + α)k contains each tree T of order k as a subgraph. The method to prove our result follows a strategy similar to approaches that employ the Szemerédi regularity lemma: We decompose the graph G, find a suitable combinatorial structure inside the decomposition, and then embed the tree T into G using this structure. Since for sparse graphs G, the decomposition given by the regularity lemma is not helpful, we use a more general decomposition technique. We show that each graph can be decomposed into vertices of huge degree, regular pairs (in the sense of the regularity lemma), and two other objects each exhibiting certain expansion properties. In this paper, we introduce this novel decomposition technique. In the three follow-up papers, we find a suitable combinatorial structure inside the decomposition, which we then use for embedding the tree.

AB - In a series of four papers we prove the following relaxation of the Loebl-Komlós-Sós conjecture: For every α > 0 there exists a number k0 such that for every k > k0, every n-vertex graph G with at least (1/2 + α)n vertices of degree at least (1 + α)k contains each tree T of order k as a subgraph. The method to prove our result follows a strategy similar to approaches that employ the Szemerédi regularity lemma: We decompose the graph G, find a suitable combinatorial structure inside the decomposition, and then embed the tree T into G using this structure. Since for sparse graphs G, the decomposition given by the regularity lemma is not helpful, we use a more general decomposition technique. We show that each graph can be decomposed into vertices of huge degree, regular pairs (in the sense of the regularity lemma), and two other objects each exhibiting certain expansion properties. In this paper, we introduce this novel decomposition technique. In the three follow-up papers, we find a suitable combinatorial structure inside the decomposition, which we then use for embedding the tree.

KW - Extremal graph theory

KW - Graph decomposition

KW - Loebl-Komlós-Sós conjecture

KW - Regularity lemma

KW - Sparse graph

KW - Tree embedding

UR - http://www.scopus.com/inward/record.url?scp=85021932060&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85021932060&partnerID=8YFLogxK

U2 - 10.1137/140982842

DO - 10.1137/140982842

M3 - Article

AN - SCOPUS:85021932060

VL - 31

SP - 945

EP - 982

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 2

ER -