Counting connected graphs and hypergraphs via the probabilistic method

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3122, Issue , 2004, Pages 322-333

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

^a HUMBOLDT UNIVERSITY   (Germany)

^b UNIVERSITY OF NEW MEXICO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BINS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GRAPHIC METHODS; OPTIMIZATION;

CONNECTED GRAPH; ENUMERATIVE COMBINATORICS; GIANT COMPONENTS; HYPER GRAPH; PROBABILISTIC METHODS; RANDOM GRAPHS; RANDOM HYPERGRAPH;

GRAPH THEORY;

EID: 35048881982     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_29     Document Type: Article

References (14)

1. Barraez, D., Boucheron, S., Fernandez de la Vega, W.: On the fluctuations of the giant component. Combinatorics, Probability and Computing 9 (2000) 287-304
2. Bender, E.A., Canfield, E.R., McKay, B.D.: The asymptotic number of labeled connected graphs with a given number of vertices and edges. Random Structures & Algorithms 1 (1990) 127-169
3. Bender, E.A., Canfield, E.R., McKay, B.D.: Asymptotic properties of labeled connected graphs. Random Structures & Algorithms 3 (1992) 183-202
4. Engel, A., Monasson, R., Hartmann, A.: On large deviation properties of ErdösRényi random graphs. Preprint arXiv, cond-mat/0311535 (2003)
5. Feller, W.: Introduction to probability theory and its applications. Wiley 1968
6. Janson, S., Luczak, T, Ruciński, A.: Random Graphs, Wiley 2000
7. Karonski, M., Luczak, T.: The phase transition in a random hypergraph. J. Comput. Appl. Math. 142 (2002) 125-135
8. Karonski, M., Luczak, T.: The number of connected sparsely edged uniform hypergraphs. Discrete Math. 171 (1997) 153-168
9. Luczak, T.: On the number of sparse connected graphs. Random Structures & Algorithms 1 (1990) 171-173
10. Moser, L. and Wyman, M.: Stirling numbers of the second kind. Duke Mathematical Journal 25 (1958) 29-43
11. O'Connell, N.: Some large deviation results for sparse random graphs. Prob. Th. Relat. Fields 110 (1998) 277-285
12. Pittel, B., Wormald, N.C.: Counting connected graphs inside out. J. Combinatorial Theory Series B, to appear
13. Schmidt-Pruzan, J., Shamir, E.: Component structure in the evolution of random hypergraphs. Combinatorica 5 (1985) 81-94
14. Temme, N.M.: Asymptotic estimates of Stirling numbers. Studies in Applied Mathematics 89 (1993) 233-243