Abstract
We prove a version of the Loebl-Komlós-Sós Conjecture for large dense graphs. For any there exists such that for any holds: If G has median degree at least k, then any tree of order at most is a subgraph of G.
Original language | English |
---|---|
Pages (from-to) | 609-613 |
Journal | Electronic Notes in Discrete Mathematics |
Volume | 34 |
DOIs | |
Publication status | Published - 2009 |
Externally published | Yes |