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

DOI10.1016/J.JCTB.2015.07.004zbMATH Open1327.05190OpenAlexW1499842851MaRDI QIDQ895997FDOQ895997

Authors: 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

Recommendations

• Loebl-Komlós-Sós conjecture: dense case
• On the Loebl-Koml�s-S�s conjecture
• On the Loebl-Komlós-Sós conjecture
• An approximate version of the Loebl-Komlós-Sós conjecture
• An approximate version of the Loebl-Komlós-Sós conjecture
• A proof of the dense version of Lovász conjecture
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
• The Erdős-Faber-Lovász conjecture for dense hypergraphs
• A skew version of the Loebl-Komlós-Sós conjecture

zbMATH Keywords

Ramsey number of treesLoebl-Komlós-Sós conjecture

Mathematics Subject Classification ID

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

Cites Work

• 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
• Ramsey numbers for trees of small maximum degree
• The Komlós conjecture for graphs of girth 7
• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
• Constructing Trees in Graphs whose Complement has no K_2,s
• Embedding large subgraphs into dense graphs
• Title not available (Why is that?)
• On the Loebl-Koml�s-S�s conjecture
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• An approximate version of the Loebl-Komlós-Sós conjecture
• Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized Ramsey theory for graphs, X: Double stars
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Loebl-Komlós-Sós conjecture

Cited In (18)

• Maximum and minimum degree conditions for embedding trees
• An approximate version of the Loebl-Komlós-Sós conjecture
• On some graph densities in locally dense graphs
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• A version of the Loebl-Komlós-Sós conjecture for skew trees
• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
• 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
• Embedding trees with maximum and minimum degree conditions
• An approximate version of the Loebl-Komlós-Sós conjecture
• Loebl-Komlós-Sós conjecture: dense case
• A skew version of the Loebl-Komlós-Sós conjecture
• Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
• A Local Approach to the Erdös--Sós Conjecture
• On the Loebl-Koml�s-S�s conjecture
• Strong 2-degenerate graph embeddings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895997)