43 citations · 235 across the 46 of their papers we have counts for
Showing 2007 · math.COShow all
2 papers · 2 filters
math.CO2007★ 2 cited
The Loebl-Komlos-Sos conjecture for trees of diameter 5 and for certain caterpillars
Diana Piguet, Maya Jakobine Stein
Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at least some k, then every tree with at most k edges is a subgraph of G. We prove th…
math.CO2007★ 4 cited
An approximate version of the Loebl-Komlos-Sos conjecture
Diana Piguet, Maya Jakobine Stein
Loebl, Komlos, and Sos conjectured that if at least half of the vertices of a graph G have degree at least some natural number k, then every tree with at most k edges is a subgraph…