Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs

DOI10.1016/J.DISC.2009.05.030zbMATH Open1184.05067OpenAlexW2094002291WikidataQ122981846 ScholiaQ122981846MaRDI QIDQ1045015FDOQ1045015

Authors: Oliver Cooley 

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.030

Recommendations

• An approximate version of the Loebl-Komlós-Sós conjecture
• Loebl-Komlós-Sós conjecture: dense case
• Loebl-Komlós-Sós conjecture: dense case
• On the Loebl-Koml�s-S�s conjecture
• On the Loebl-Komlós-Sós conjecture

zbMATH Keywords

embeddingregularity LemmaRamsey numbers of treesLoebl-Komlós-Sós conjecture

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cites Work

• The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Komlós conjecture for graphs of girth 7
• Constructing Trees in Graphs whose Complement has no K_2,s
• 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?)
• Title not available (Why is that?)
• The Erdős‐Sós Conjecture for trees of diameter four
• On the Loebl-Komlós-Sós conjecture
• An approximate version of the Loebl-Komlós-Sós conjecture

Cited In (20)

• Maximum and minimum degree conditions for embedding trees
• Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• An approximate version of the Loebl-Komlós-Sós conjecture
• Proof of the Seymour conjecture for large 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
• Loebl-Komlós-Sós conjecture: dense case
• 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
• 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
• On the Loebl-Komlós-Sós conjecture
• A skew version of the Loebl-Komlós-Sós conjecture
• Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
• Embedding trees in graphs with independence number two
• 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: Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs

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