High degree graphs contain large-star factors
Combinatorics
2008-10-14 v1
Abstract
We show that any finite simple graph with minimum degree contains a spanning star forest in which every connected component is of size at least . This settles a problem of J. Kratochvil.
Keywords
Cite
@article{arxiv.0810.2053,
title = {High degree graphs contain large-star factors},
author = {Noga Alon and Nicholas Wormald},
journal= {arXiv preprint arXiv:0810.2053},
year = {2008}
}