Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172] (DOI:10.1016/j.jctb.2004.09.005);Counting connected graphs inside-out

Journal of Combinatorial Theory. Series B

Volumn 93, Issue 2, 2005, Pages 127-172

  Pittel, Boris ^a   Wormald, Nicholas C ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Asymptotics; Connected; Core; Enumeration; Graphs; Limit distributions

Indexed keywords

EID: 12944257224     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2007.10.005     Document Type: Erratum

References (22)

1. J. Aronson A. Frieze B.G. Pittel Maximum matchings in sparse random graphs: Karp-Sipser revisited Random Structures Algorithms 12 1998 111-177
2. A. Békéssy P. Békéssy J. Komlós Asymptotic enumeration of regular matrices Studia Sci. Math. Hungar. 7 1972 343-353
3. E.A. Bender E.R. Canfield The asymptotic number of labeled graphs with given degree sequences J. Combin. Theory, Ser. A 24 1978 296-307
4. E.A. Bender E.R. Canfield B.D. McKay The asymptotic number of labeled connected graphs with a given number of vertices and edges Random Structures Algorithms 1 1990 127-169
5. B. Bollobás A probabilistic proof of an asymptotic formula for the number of labelled regular graphs European J. Combin. 1 1980 311-316
6. B. Bollobás The evolution of random graphs Trans. Amer. Math. Soc. 286 1984 257-274
7. P. Erdos A. Rényi On the evolution of random graphs Publ. Math. Inst. Hungar. Acad. Sci. 5 1960 17-61
8. S. Janson D.E. Knuth T. Łuczak B. Pittel The birth of the giant component Random Structures Algorithms 4 1993 233-358
9. S. Janson T. Łuczak A. Ruciński Random Graphs 2000 Wiley New York
10. M. Karoński T. Łuczak The phase transition in a random hypergraph J. Comput. Appl. Math. 142 2002 125-135
11. T. Łuczak Component behavior near the critical point of the random graph process Random Structures Algorithms 1 1990 287-310
12. T. Łuczak Cycles in a random graph near the critical point Random Structures Algorithms 2 1991 421-440
13. T. Łuczak Sparse random graphs with a given degree sequence in: A. Frieze T. Łuczak (Eds.), Random Graphs vol. 2 1992 Wiley New York 165-182
14. B.D. McKay Asymptotics for symmetric 0-1 matrices with prescribed row sums Ars Combin. 19A 1985 15-25
15. B. Pittel On trees census and the giant component in a sparse random graph Random Structures Algorithms 1 1990 311-342
16. B. Pittel N.C. Wormald Asymptotic enumeration of sparse graphs with a minimum degree constraint J. Combin. Theory, Ser. A 101 2003 249-263
17. V.E. Stepanov Some features of the structure of a random graph near a critical point Teor. Veroyatnost. i Primenen. 32 1987 633-657 (in Russian)
18. N.C. Wormald, Some problems in the enumeration of labelled graphs, Doctoral thesis, Newcastle University, 1978.
19. N.C. Wormald The asymptotic connectivity of labelled regular graphs J. Combin. Theory, Ser. B 31 1981 156-167
20. E.M. Wright The number of connected sparsely edged graphs J. Graph Theory 1 1977 317-330
21. E.M. Wright Formulae for the number of sparsely-edged strong labelled digraphs Quart. J. Math. Oxford Ser. 28 2 1977 363-367
22. E.M. Wright The number of connected sparsely edged graphs. II. Smooth graphs and blocks J. Graph Theory 2 1978 299-350