Star-factors in graphs of high degree
Abstract
We prove that every graph with sufficiently large minimum degree d contains a spanning forest in which every component is a star of size at least d - O(d1/4). This improves the result of Alon and Wormald and is optimal up to the lower order term.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.