Consider the set of $r$-regular labeled graphs with $n$ vertices. There are results on its asymptotic size (see for instance this question on MO).
Is there a known, explicit lower bound on that size, valid for any $r$ and $n$?
Consider the set of $r$-regular labeled graphs with $n$ vertices. There are results on its asymptotic size (see for instance this question on MO).
Is there a known, explicit lower bound on that size, valid for any $r$ and $n$?