Title of article
An approximate version of the Loebl-Komlَs-Sَs conjecture
Author/Authors
Piguet، نويسنده , , Diana and Stein، نويسنده , , Maya، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
5
From page
249
To page
253
Abstract
The Loebl–Komlós–Sós conjecture states that, given a graph G and a natural number k, if at least half the vertices of G have degree at least k, then any tree with at most k edges is a subgraph of G.
ve an approximate version of this conjecture for large graphs and k linear in | V ( G ) | .
Keywords
Loebl–Koml?s–S?s conjecture , Szemerédiיs regularity lemma
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2007
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454714
Link To Document