Counting connected graphs and hypergraphs via the probabilistic method

Random Structures and Algorithms

Volumn 31, Issue 3, 2007, Pages 288-329

  Coja Oghlan, Amin ^a   Moore, Cristopher ^b   Sanwalani, Vishal ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b MSC01 1070

Author keywords

Connectivity; Giant component; Probabilistic method; Random graphs; Random hypergraphs

Indexed keywords

EID: 34948874377     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20160     Document Type: Article

References (20)

1. N. Alon and J. Spencer, The probabilistic method, 2nd ed., John Wiley and Sons, Hoboken, NJ, 2000.
2. T. Andriamampianina and V. Ravelomanana, Enumeration of connected uniform hypergraphs, Proceedings of FPSAC, Messina, Italy, 2005.
3. N. Arora and J. Spencer, Generating random connected graphs, Preprint, 2005.
4. D. Barraez, S. Boucheron, and W. Fernandez de la Vega, On the fluctuations of the giant component, Combinator Probab Comput 9 (2000), 287-304.
5. E. A. Bender, E. R. Canfield, and B. D. McKay, The asymptotic number of labeled connected graphs with a given number of vertices and edges, Random Struct Algorithm 1 (1990), 127-169.
6. E. A. Bender, E. R. Canfield, and B. D. McKay, Asymptotic properties of labeled connected graphs, Random Struct Algorithm 3 (1992), 183-202.
7. B. Bollobás, Random graphs, 2nd ed., Cambridge University Press, Cambridge, 2001.
8. W. Feller, Introduction to probability theory and its applications, John Wiley and Sons, Hoboken, NJ, 1968.
9. P. Flajolet, B. Salvy, and G. Schaeffer, Airy phenomena and analytic combinatorics of connected graphs, Electron J Combinator 11 (2004), R34.
10. R. van der Hofstad and J. Spencer, Counting connected graphs asymptotically, Eur J Combinator, (to appear).
11. S. Janson, The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph, Random Struct Algorithm 7 (1995), 337-356.
12. S. Janson, D. Knuth, T. Łuczak, and B. Pittel, The birth of the giant component, Random Struct Algorithm 4 (1993), 233-358.
13. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, John Wiley and Sons, Hoboken, NJ, 2000.
14. M. Karoński and T. Łuczak, The phase transition in a random hypergraph, J Comput Appl Math 142 (2002), 125-135.
15. M. Karoñski and T. Łuczak, The number of connected sparsely edged uniform hypergraphs, Discrete Math 171 (1997), 153-168.
16. T. Łuczak, On the number of sparse connected graphs, Random Struct Algorithm 1 (1990), 171-173.
17. N. O'Connell, Some large deviation results for sparse random graphs, Prob Th Relat Fields 110 (1998), 277-285.
18. B. Pittel, On tree census and the giant component in sparse random graphs, Random Struct Algorithm 1 (1990), 311-342.
19. B. Pittel and N. C. Wormald, Counting connected graphs inside out, J Combin Theor B 93 (2005), 127-172.
20. J. Schmidt-Pruzan and E. Shamir, Component structure in the evolution of random hypergraphs, Combinatorica 5 (1985), 81-94.