TY - GEN
T1 - High degree graphs contain large-star factors
AU - Alon, Noga
AU - Wormald, Nicholas
PY - 2010
Y1 - 2010
N2 - We show that any finite simple graph with minimum degree d contains a spanning star forest in which every connected component is of size at least Ω((d/log d)1/3). This settles a problem of Havet, Klazar, Kratochvil, Kratsch and Liedloff.
AB - We show that any finite simple graph with minimum degree d contains a spanning star forest in which every connected component is of size at least Ω((d/log d)1/3). This settles a problem of Havet, Klazar, Kratochvil, Kratsch and Liedloff.
UR - https://www.scopus.com/pages/publications/78449286359
UR - https://www.scopus.com/pages/publications/78449286359#tab=citedBy
U2 - 10.1007/978-3-642-13580-4_1
DO - 10.1007/978-3-642-13580-4_1
M3 - Conference contribution
SN - 9783642135798
T3 - Bolyai Society Mathematical Studies
SP - 9
EP - 21
BT - Fete of Combinatorics and Computer Science
T2 - Meeting on Fete of Combinatorics and Computer Science
Y2 - 11 August 2008 through 15 August 2008
ER -