Counting connected hypergraphs via the probabilistic method

Béla Bollobás, Oliver Riordan

In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number of connected graphs on $[n]$ with $m$ edges, whenever $n$ and the nullity $m-n+1$ tend to infinity. Asy…