Geodesic
The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
The electronic journal of combinatorics, Tome 15 (2008)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
Loebl, Komlós, and Sós conjectured that if at least half the vertices of a graph $G$ have degree at least some $k\in \Bbb N$, 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,T')$ of trees $T,T'$ from the above classes.
DOI : 10.37236/830
Classification : 05C05, 05C35 
Diana Piguet; Maya Jakobine Stein. The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/830
@article{10_37236_830,
     author = {Diana Piguet and Maya Jakobine Stein},
     title = {The {Loebl-Koml\'os-S\'os} conjecture for trees of diameter 5 and for certain caterpillars},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/830},
     zbl = {1158.05315},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/830/}
}
TY  - JOUR
AU  - Diana Piguet
AU  - Maya Jakobine Stein
TI  - The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/830/
DO  - 10.37236/830
ID  - 10_37236_830
ER  - 
%0 Journal Article
%A Diana Piguet
%A Maya Jakobine Stein
%T The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/830/
%R 10.37236/830
%F 10_37236_830

Cité par Sources :