Birth control for giants

Combinatorica

Volumn 27, Issue 5, 2007, Pages 587-628

  Spencer, Joel ^a   Wormald, Nicholas ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 44449152582     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-007-2163-2     Document Type: Article

References (9)

1. N. Alon and J. Spencer: The Probabilistic Method, 2nd ed., John Wiley, 2000.
2. T. Bohman and A. Frieze: Avoiding a giant component, Random Structures & Algorithms 19 (2001), 75-85.
3. T. Bohman, A. Frieze and N. C. Wormald: Avoidance of a giant component in half the edge set of a random graph, Random Structures & Algorithms 25(4) (2004), 432-449.
4. T. Bohman and D. Kravitz: Creating a giant component, Combinatorics, Probability & Computing 15(4) (2006), 489-511.
5. A. Flaxman, D. Garmanik and G. B. Sorkin: Embracing the giant component, pp. 69-79 in Latin 2004: Theoretical Informatics, M. Farach-Coltin (ed), Lecture Notes in Computer Science 2976, Springer, 2004.
6. W. Hurewicz: Lectures on Ordinary Differential Equations, M.I.T. Press, Cambridge, Massachusetts, 1958.
7. N. C. Wormald: The differential equation method for random graph processes and greedy algorithms, in Lectures on Approximation and Randomized Algorithms, M. Karoński and H. J. Prömel (eds), pp. 73-155, PWN, Warsaw, 1999.
8. N. C. Wormald: Analysis of greedy algorithms on graphs with bounded degrees, Discrete Mathematics 273 (2003), 235-260.
9. N. C. Wormald: Random graphs and asymptotics; Section 8.2 in Handbook of Graph Theory, J. L. Gross and J. Yellen (eds), pp. 817-836, CRC, Boca Raton, 2004.