𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Loebl-Komlós-Sós Conjecture: dense case

✍ Scribed by Oliver Cooley; Jan Hladký; Diana Piguet

Book ID
108120728
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
168 KB
Volume
34
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Loebl–Komlós–Sós conjecture
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).