Boris Pittel, Nicholas C. Wormald. Asymptotic enumeration of sparse graphs with a minimum degree constraint. Journal of Combinatorial Theory, Series A, 101(2):249-263, 2003. [doi]
@article{PittelW03,
title = {Asymptotic enumeration of sparse graphs with a minimum degree constraint},
author = {Boris Pittel and Nicholas C. Wormald},
year = {2003},
doi = {10.1016/S0097-3165(02)00017-1},
url = {http://dx.doi.org/10.1016/S0097-3165(02)00017-1},
tags = {constraints, graph-rewriting, C++, rewriting},
researchr = {https://researchr.org/publication/PittelW03},
cites = {0},
citedby = {0},
journal = {Journal of Combinatorial Theory, Series A},
volume = {101},
number = {2},
pages = {249-263},
}