Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. 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

In Maples package RandomGraphs, there is a method called RandomRegularGraph(n,d) which takes a number of vertices $n$ and a degree $d$ and returns a random $d$-regular graph on $n$ vertices. Does anybody know how this random regular graph is sampled, and if it is in fact uniformly chosen from all $d$-regular graphs on $n$ vertices?

share|cite|improve this question

Your Answer


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

Browse other questions tagged or ask your own question.