Asymptotic enumeration of strongly connected digraphs by vertices and edges

Xavier Perez-Gimenez, Nicholas Wormald

We derive an asymptotic formula for the number of strongly connected digraphs with $n$ vertices and $m$ arcs (directed edges), valid for $m-n\to \infty$ as $n\to \infty$ provided $m…