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$?
MathOverflow is a question and answer site for professional mathematicians. It only takes a minute to sign up.Sign up to join this community