The Loebl-Komlos-Sos conjecture for trees of diameter 5 and for certain caterpillars

Simple item page
dc.creatorPiguet, Diana
dc.creatorStein, Maya Jakobine
dc.date2007-12-20
dc.date.accessioned2026-07-07T08:50:34Z
dc.date.available2026-07-07T08:50:34Z
dc.descriptionLoebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at least some k, then every tree with at most k edges is a subgraph of G. We prove the conjecture for all trees of diameter at most 5 and for a class of caterpillars. Our result implies a bound on the Ramsey number r(T,F) of trees T, F from the above classes.
dc.description11 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/0712.3382
dc.identifierhttp://arxiv.org/abs/0712.3382
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144646
dc.subjectCombinatorics
dc.subject05C05
dc.titleThe Loebl-Komlos-Sos conjecture for trees of diameter 5 and for certain caterpillars
dc.typetext

Files

Collections

arXiv