High degree graphs contain large-star factors

Bolyai Society Mathematical Studies

Volumn 20, Issue , 2010, Pages 9-21

  Alon, Noga ^a,b   Wormald, Nicholas ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED COMPONENT; DEGREE GRAPHS; FINITE SIMPLE GRAPHS; MINIMUM DEGREE;

COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE;

STARS;

EID: 78449286359     PISSN: 12174696     EISSN: 12174696     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-642-13580-4_1     Document Type: Conference Paper

References (12)

1. N. Alon, A parallel algorithmic version of the local lemma, Random Structures and Algorithms, 2 (1991), 367-378.
2. N. Alon, Tools from higher algebra, in: Handbook of Combinatorics (R. L. Graham, M. Grötschel and L. Lovász, eds), North Holland (1995), Chapter 32, pp. 1749-1783.
3. N. Alon, C. McDiarmid and B. Reed, Star arboricity, Combinatorica, 12 (1992), 375-380.
4. N. Alon and J. H. Spencer, The Probabilistic Method, Third Edition, Wiley (New York, 2008).
5. H. Assiyatun and N. Wormald, 3-star factors in random regular graphs, Europ. J. Combinatorics, 27 (2006), 1249-1262.
6. J. Beck, An algorithmic approach to the Lovasz Local Lemma, Random Structures and Algorithms, 2 (1991), 343-365.
7. Y. Caro, D. B. West and R. Yuster, Connected domination and spanning trees with many leaves, SIAM J. Discrete Math., 13 (2000), 202-211.
8. J. R. Griggs and M. Wu, Spanning trees in graphs of minimum degree four or five, Discrete Mathematics, 104 (1992), 167-183.
9. F. Havet, M. Klazar, J. Kratochvil, D. Kratsch and M. Liedloff, Exact algorithms for L(2, l)-labelling, Algorithmica, to appear.
10. J. Kratochvil, An open problem presented in "Building Bridges,", Budapest, 2008.
11. D. J. Kleitman and D. B. West, Spanning trees with many leaves, SIAM Journal on Discrete Mathematics, 4 (1991), 99-106.
12. N. C. Wormald, Models of random regular graphs, in: Surveys in Combinatorics, 1999, London Mathematical Society Lecture Note Series 267 (J. D. Lamb and D. A. Preece, eds), Cambridge University Press (Cambridge, 1999), pp. 239-298.