High degree graphs contain large-star factors

Noga Alon, Nicholas Wormald

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 Ω((d/log d)1/3). This settles a problem of Havet, Klazar, Kratochvil, Kratsch and Liedloff.

Original languageEnglish
Title of host publicationFete of Combinatorics and Computer Science
Pages9-21
Number of pages13
DOIs
StatePublished - 2010
EventMeeting on Fete of Combinatorics and Computer Science - Keszthely, Hungary
Duration: 11 Aug 200815 Aug 2008

Publication series

NameBolyai Society Mathematical Studies
Volume20
ISSN (Print)1217-4696
ISSN (Electronic)1217-4696

Conference

ConferenceMeeting on Fete of Combinatorics and Computer Science
Country/TerritoryHungary
CityKeszthely
Period11/08/0815/08/08

Funding

FundersFunder number
Seventh Framework Programme226718

    Fingerprint

    Dive into the research topics of 'High degree graphs contain large-star factors'. Together they form a unique fingerprint.

    Cite this