| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 11021702 | Journal of Combinatorial Theory, Series B | 2018 | 10 Pages |
Abstract
We prove that every graph of minimum degree d contains a spanning forest in which every component is a star of size at least dâOË(d1/4). This improves a result of Alon and Wormald and is optimal up to the lower order term.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Rajko Nenadov,