Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
From MaRDI portal
Publication:625393
zbMath1231.05142MaRDI QIDQ625393
Publication date: 17 February 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/233252
Trees (05C05) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (10)
Embedding trees in graphs with independence number two ⋮ A version of the Loebl-Komlós-Sós conjecture for skew trees ⋮ Loebl-Komlós-Sós conjecture: dense case ⋮ Maximum and Minimum Degree Conditions for Embedding Trees ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ 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 IV: Embedding Techniques and the Proof of the Main Result ⋮ The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
This page was built for publication: Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
