Abstract
Purchase PDF (188 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (5)
Purchase PDF (549 K)
α(
doi:10.1016/S0097-3165(02)00017-1 
Copyright © 2003 Elsevier Science (USA). All rights reserved.
Asymptotic enumeration of sparse graphs with a minimum degree constraint
Received 29 April 2002.
Available online 20 February 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We derive an asymptotic formula for the number of graphs with n vertices all of degree at least k, and m edges, with k fixed. This is done by summing the asymptotic formula for the number of graphs with a given degree sequence, all degrees at least k. This approach requires analysis of a set of independent truncated Poisson variables, which approximate the degree sequence of a random graph chosen uniformly at random among all graphs with n vertices, m edges, and a minimum degree at least k. Our main result generalizes a result of Bender, Canfield and McKay and of Korshunov, who treated the case k=1 using different methods.
