The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars

zbMath1158.05315arXiv0712.3382MaRDI QIDQ1010834

Maya Jakobine Stein, Diana Piguet

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0712.3382

Mathematics Subject Classification ID

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

Related Items (6)

Embedding trees in graphs with independence number two ⋮ Loebl-Komlós-Sós conjecture: dense case ⋮ An approximate version of the Loebl-Komlós-Sós 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 approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs

This page was built for publication: The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars