Asymptotic enumeration of sparse 2-connected graphs

Graeme Kemkes, Cristiane M. Sato, Nicholas Wormald

We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on $n$ vertices and $m$ edges, provided that $m-n\to \infty$ and $m=O(n\log n)$ as $n\to\in…