Affordable Access

High degree graphs contain large-star factors

Authors
Type
Preprint
Publication Date
Submission Date
Source
arXiv
License
Yellow
External links

Abstract

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 $\Omega((d/\log d)^{1/3})$. This settles a problem of J. Kratochvil.

Statistics

Seen <100 times