The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs

DOI10.3934/era.2015.22.1zbMath1332.05074arXiv1406.3935OpenAlexW3104378477WikidataQ122973161 ScholiaQ122973161MaRDI QIDQ256345

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

Publication date: 9 March 2016

Published in: Electronic Research Announcements in Mathematical Sciences (Search for Journal in Brave)

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

zbMATH Keywords

regularity lemmaextremal graph theoryLoebl-Komlós-Sós conjecturesparse graphstree-containment problems

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42)

Related Items

A version of the Loebl-Komlós-Sós conjecture for skew trees, Loebl-Komlós-Sós conjecture: dense case, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
• Loebl-Komlós-Sós conjecture: dense case
• How to avoid using the regularity Lemma: Pósa's conjecture revisited
• The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• Proof of the Seymour conjecture for large graphs
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• Ramsey numbers for trees of small maximum degree
• The Erdös-Sós conjecture for graphs of girth 5
• The Komlós conjecture for graphs of girth 7
• Moments of two-variable functions and the uniqueness of graph limits
• Tree embeddings
• Constructing Trees in Graphs whose Complement has no K_2,s
• On maximal paths and circuits of graphs
• Embedding large subgraphs into dense graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4506067 On the Loebl-Koml�s-S�s conjecture]
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]
• Can a Graph Have Distinct Regular Partitions?
• 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 History of Degenerate (Bipartite) Extremal Graph Problems
• An approximate version of the Loebl-Komlós-Sós conjecture