The asymptotic number of connected d-uniform hypergraphs

Combinatorics Probability and Computing

Volumn 23, Issue 3, 2014, Pages 367-385

  Behrisch, Michael ^a   Coja Oghlan, Amin ^b   Kang, Mihyun ^c  

^a GERMAN AEROSPACE CENTER DLR   (Germany)

^b GOETHE UNIVERSITY   (Germany)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

2010 Mathematics subject classification: Primary 05C80; Secondary 05C65

Indexed keywords

CLASSIFICATION (OF INFORMATION);

ASYMPTOTIC PROBABILITIES; HYPERGRAPH; LOCAL LIMIT THEOREM; PROBABILITY P; SECONDARY 05C65; SUBJECT CLASSIFICATION; HYPER GRAPH;

GRAPH THEORY;

EID: 84898041157     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548314000029     Document Type: Article

References (18)

1. Andriamampianina, T. and Ravelomanana, V. (2005) Enumeration of connected uniform hypergraphs. In Proc. FPSAC 2005.
2. Behrisch, M., Coja-Oghlan, A. and Kang, M. (2007) Local limit theorems for the giant component of random hypergraphs. In Proc. RANDOM 2007, Vol. 4627 of Lecture Notes in Computer Science, Springer, pp. 341-352.
3. Behrisch, M., Coja-Oghlan, A. and Kang, M. (2010) The order of the giant component of random hypergraphs. Random Struct. Alg. 36 149-184.
4. Behrisch, M., Coja-Oghlan, A. and Kang, M. (2014) Local limit theorems for the giant component of random hypergraphs. Combin. Probab. Comput. doi:10.1017/S0963548314000017
5. Bender, E. A., Canfield, E. R. and McKay, B. D. (1990) The asymptotic number of labeled connected graphs with a given number of vertices and edges. Random Struct. Alg. 1 127-169.
6. Bender, E. A., Canfield, E. R. and McKay, B. D. (1992) Asymptotic properties of labeled connected graphs. Random Struct. Alg. 3 183-202.
7. Bollob?as, B. (2001) Random Graphs, second edition, Cambridge University Press.
8. Coja-Oghlan, A., Moore, C. and Sanwalani, V. (2007) Counting connected graphs and hypergraphs via the probabilistic method. Random Struct. Alg. 31 288-329.
9. Erd?os, P. and R?enyi, A. (1959) On random graphs I. Publicationes Math. Debrecen 5 290-297.
10. Erd?os, P. and R?enyi, A. (1960) On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5 17-61.
11. van der Hofstad, R. and Spencer, J. (2006) Counting connected graphs asymptotically. European J. Combin. 27 1294-1320.
12. Janson, S., Luczak, T. and Rucin?ski, A. (2000) Random Graphs, Wiley.
13. Karon?ski, M. and Luczak, T. (1997) The number of connected sparsely edged uniform hypergraphs. Discrete Math. 171 153-168.
14. [14]-Luczak, T. (1990) On the number of sparse connected graphs. Random Struct. Alg. 1 171-173.
15. O'Connell, N. (1998) Some large deviation results for sparse random graphs. Probab. Theory Rel. Fields 110 277-285.
16. Pittel, B. and Wormald, N. C. (2005) Counting connected graphs inside out. J. Combin. Theory Ser. B 93 127-172.
17. Schmidt-Pruzan, J. and Shamir, E. (1985) Component structure in the evolution of random hypergraphs. Combinatorica 5 81-94.
18. Stepanov, V. E. (1970) On the probability of connectedness of a random graph gm(t). Theory Probab. Appl. 15 55-67.