MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Fix numbers n,k. Is there a closed formula known for the number of k-regular graphs consisting of n edges? I have a method of enumerating k-regular graphs on n edges, and would like to have a number to compare the algorithm against.

share|cite|improve this question
I don't think there's any closed form formula, but you can compare your results with the data in OEIS, such as here: (for 3-regular graphs) or here: This is indexed by the number of vertices, not edges, but of course for fixed k this is the same up to a factor of k/2. – Alon Amit Apr 21 '10 at 18:44
up vote 1 down vote accepted

I think the answer is no, but I would consult the following link:

which contains tables of the sums of the numbers you are interested in. The author is very generous with sharing data that is not posted online.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.