Abstract: | The Loebl–Komlós–Só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). © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 269–276, 2000 |