Asymptotic enumeration of sparse graphs with a minimum degree constraint

@article{Pittel2003AsymptoticEO,
  title={Asymptotic enumeration of sparse graphs with a minimum degree constraint},
  author={Boris Pittel and Nicholas C. Wormald},
  journal={J. Comb. Theory, Ser. A},
  year={2003},
  volume={101},
  pages={249-263}
}
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… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

On the number of graphs with a fixed number of vertices, edges, and isolated vertices (translation of Discrete Analysis (Russian)

A. D. Korshunov
Izdat. Ross. Akad. Nauk Sibirsk. Otdel. Inst. Mat., Novosibirsk, • 1994
View 3 Excerpts
Highly Influenced

Asymptotics for symmetric 0-1 matrices with prescribed row sums

B. D. McKay
Ars Combinatoria • 1985
View 2 Excerpts
Highly Influenced

A graphvalued Markov process as ringsallowed polymerization model : subcritical behavior

W. A. Woyczynski
J . Combinatorial Theory , Series B • 1996

Sparse random graphs with a given degree sequence

T. Luczak
In Random Graphs • 1992
View 1 Excerpt

Similar Papers

Loading similar papers…