3
$\begingroup$

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$?

Improve this question
$\endgroup$
1
  • 1
    $\begingroup$ It is easy to see that once you have your $N(r, n_0)=a>1,$ then $N(r, k n_0) \geq a^k.$ $\endgroup$
    – Igor Rivin
    Commented Mar 20, 2017 at 16:37

0

Reset to default

You must log in to answer this question.

Browse other questions tagged .