On the Loebl–Komlós–Sós conjecture
✍
Cristina Bazgan; Hao Li; Mariusz Woźniak
📂
Article
📅
2000
🏛
John Wiley and Sons
🌐
English
⚖ 104 KB
The Loebl±Komlo  s±So  s conjecture says that any graph G on n vertices with at least half of vertices of degree at least k contains each tree of size k. We prove that the conjecture is true for paths as well as for large values of k(k ! n À 3).