A version of the Loebl-Komlós-Sós conjecture for skewed trees

Tereza Klimošová, Diana Piguet, Václav Rozhoň

Loebl, Komlós, and Sós conjectured that any graph with at least half of its vertices of degree at least k contains every tree with at most k edges. We propose a version of this con…