114
click to vote
CPC
1998
15 years 3 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...