Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fete of Combinatorics and Computer ScienceHigh Degree Graphs Contain Large-Star Factors

Fete of Combinatorics and Computer Science: High Degree Graphs Contain Large-Star Factors [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Fete of Combinatorics and Computer ScienceHigh Degree Graphs Contain Large-Star Factors

Part of the Bolyai Society Mathematical Studies Book Series (volume 20)
Editors: Katona, Gyula O. H.; Schrijver, Alexander; Szőnyi, Tamás; Sági, Gábor
Alon, Noga; Wormald, Nicholas
Fete of Combinatorics and Computer Science — Jan 31, 2011
Download PDF
12 pages

Loading next page...
 
/lp/springer-journals/fete-of-combinatorics-and-computer-science-high-degree-graphs-contain-H6jt8xPqYd
Publisher
Springer Berlin Heidelberg
Copyright
© János Bolyai Mathematical Society and Springer-Verlag 2010
ISBN
978-3-642-13579-8
Pages
9 –21
DOI
10.1007/978-3-642-13580-4_1
Publisher site
See Chapter on Publisher Site

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.]

Published: Jan 31, 2011

Keywords: Span Tree; Bipartite Graph; Minimum Degree; Time Label; Local Lemma

There are no references for this article.