We survey results on counting graphs with given degree sequence, focusing on asymptotic results, and mentioning some of the applications of these results. The main recent development is the proof of a conjecture that facilitates access to the degree sequence of a random graph via a model incorporating independent binomial random variables. The basic method used in the proof was to examine the changes in the counting function when the degrees are perturbed. We compare with several previous uses of this type of method.
展开▼
