Asymptotic enumeration of sparse graphs with a minimum degree constraint

Journal of Combinatorial Theory. Series A

Volumn 101, Issue 2, 2003, Pages 249-263

  Pittel, Boris ^a   Wormald, Nicholas C ^b,c  

^a OHIO STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037301752     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-3165(02)00017-1     Document Type: Article

References (15)

1. J. Aronson, A. Frieze, B.G. Pittel, Maximum matchings in sparse random graphs: Karp-Sipser revisited, Random Struct. Algorithms 12 (1998) 111-177.
2. E.A. Bender, Central and local limit theorems applied to asymptotic enumeration, J. Combin. Theory Ser. A 15 (1973) 91-111.
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 Struct. Algorithms 1 (1990) 127-169.
5. E.A. Bender, E.R. Canfield, B.D. McKay, The asymptotic number of labeled graphs with n vertices, q edges, and no isolated vertices, J. Combin. Theory Ser. A 80 (1997) 124-150.
6. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European J. Combin. 1 (1980) 311-316.
7. P. Erdos, A. Rényi, On the strength of connectedness of a random graph, Acta Math. Acad. Sci. Hungar. 12 (1961) 261-267.
8. A.D. Korshunov, On the number of graphs with a fixed number of vertices, edges, and isolated vertices (translation of Discrete Analysis (Russian), 93, Izdat. Ross. Akad. Nauk Sibirsk. Otdel. Inst. Mat., Novosibirsk, 1994, pp. 43-93) Siberian Adv. Math. 5 (1995) 50-112.
9. T. Łuczak, Sparse random graphs with a given degree sequence, in: A. Frieze, T. Łuczak (Eds.), Random Graphs, Vol. 2, Wiley, New York, 1992, pp. 165-182.
10. B.D. McKay, Asymptotics for symmetric 0-1 matrices with prescribed row sums, Ars Combin. 19A (1985) 15-25.
11. 1/2), Combinatorica 11 (1991) 369-382.
12. B. Pittel, Paths in a random digital tree: limiting distributions, Adv. Appl. Probab. 18 (1986) 139-155.
13. B. Pittel, J. Spencer, N.C. Wormald, Sudden emergence of a giant k-core in a random graph, J. Combin. Theory Ser. B 67 (1996) 111-151.
14. B. Pittel, W.A. Woyczynski, A graph-valued Markov process as rings-allowed polymerization model: subcritical behavior, SIAM J. Appl. Math. 50 (1990) 1200-1220.
15. N.C. Wormald, Models of random regular graphs, in: J.D. Lamb, D.A. Preece (Eds.), Surveys in Combinatorics, 1999, London Mathematical Society Lecture Note Series, Vol. 267, Cambridge University Press, Cambridge, 1999, pp. 239-298.