scientific article; zbMATH DE number 861349

zbMath0844.05037MaRDI QIDQ4871074

János Komlós, Miklós Ajtai, Endre Szemerédi

Publication date: 18 August 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

degreetreesconjecture of Loebl

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

On the Erdős–Sós conjecture for trees with bounded degree, Degree conditions on copies of forests in graphs, Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result, Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result, Loebl-Komlós-Sós conjecture: dense case, Dirac-type conditions for spanning bounded-degree hypertrees, Maximum and Minimum Degree Conditions for Embedding Trees, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, An approximate version of the Loebl-Komlós-Sós conjecture, An approximate version of the Loebl-Komlós-Sós conjecture, An Erdős-Gallai type theorem for vertex colored graphs, Degree Conditions for Embedding Trees, Degree conditions for forests in 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 IV: Embedding Techniques and the Proof of the Main Result, The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs