OFFSET
0,4
COMMENTS
Terms may be computed without generating each tournament by enumerating the number of tournaments by degree sequence. A PARI program showing this technique for labeled tournaments is given in A007079. Burnside's lemma as applied in A000568 can be used to extend this method to the unlabeled case. - Andrew Howroyd, Mar 13 2020
LINKS
Gunnar Brinkmann, Generating regular directed graphs, Discrete Math., 313 (2012), 1-7. [N. J. A. Sloane, Nov 26 2012]
Marc Chamberland and Eugene A. Herman, Rock-paper-scissors meets Borromean rings, The Mathematical Intelligencer, 37(2), 20--25.
Marc Chamberland, What's Better than Rock Paper Scissors? (2014).
B. D. McKay, Catalogues of directed graphs.
B. D. McKay, The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs, Combinatorica 10 (1990), 367-377.
CROSSREFS
KEYWORD
more,nonn
AUTHOR
David J. Haglin (david.haglin(AT)mnsu.edu), Jul 02 2004
EXTENSIONS
Offset and count for 15 vertices corrected by Brendan McKay, Dec 09 2008
a(0) from Álvar Ibeas, Nov 18 2017
a(8)-a(12) from Andrew Howroyd, Mar 13 2020
STATUS
approved