Loebl-Komlós-Sós conjecture: dense case

DOI10.1016/j.jctb.2015.07.004zbMath1327.05190OpenAlexW1499842851MaRDI QIDQ895997

Jan Hladký, Diana Piguet

Publication date: 11 December 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2015.07.004

zbMATH Keywords

Loebl-Komlós-Sós conjectureRamsey number of trees

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Related Items (10)

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 ⋮ Maximum and Minimum Degree Conditions for Embedding Trees ⋮ 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

• 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\)
• 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
• Generalized Ramsey theory for graphs, X: Double stars
• Ramsey numbers for trees of small maximum degree
• The Komlós conjecture for graphs of girth 7
• Constructing Trees in Graphs whose Complement has no K_2,s
• Embedding large subgraphs into dense graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4506067 On the Loebl-Koml�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
• An approximate version of the Loebl-Komlós-Sós conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Loebl-Komlós-Sós conjecture: dense case