Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\) (Q1181014)

Let \(G[k(n)]\) denote the number of labelled simple graphs with the degree sequence \(k(n)=(k_ 1,k_ 2,\dots,k_ n)\). Define \(k_{\max}=\max\{k_ 1,k_ 2,\dots,k_ n\}\) and \(M=\sum^ n_{i=1}k_ i\). The authors use switching operations to obtain the asymptotic expression for \(G[k(n)]\) when \(k_{\max}=o(M^{1/3})\). The paper extends the previous work of the authors [Eur. J. Comb. 11, 565-580 (1990)].