|
|
REFERENCES
|
CRC Handbook of Combinatorial Designs (see pages 655, 720-723).
Jeffrey H. Dinitz, David K. Garnick, Brendan D. McKay, There are 526,915,620 nonisomorphic one-factorizations of K_{12}. J. Combin. Des. 2 (1994), no. 4, 273-285.
Petteri Kaski and Patric R. J. Östergård, There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of K_{14}, Journal of Combinatorial Designs 17 (2009), pp. 147-159.
Charles C. Lindner, Eric Mendelsohn, and Alexander Rosa. "On the number of 1-factorizations of the complete graph." Journal of Combinatorial Theory, Series B 20.3 (1976): 265-282.
E. Seah and D. R. Stinson, On the enumeration of one-factorizations of complete graphs containing prescribed automorphism groups. Math. Comp. 50 (1988), 607-618.
W. D. Wallis, 1-Factorizations of complete graphs, pp. 593-631 in Jeffrey H. Dinitz and D. R. Stinson, Contemporary Design Theory, Wiley, 1992.
D. V. Zinoviev, On the number of 1-factorizations of a complete graph [in Russian], Problemy Peredachi Informatsii, 50 (No. 4), 2014, 71-78.
|
|
|
LINKS
|
Table of n, a(n) for n=1..7.
Petteri Kaski and Patric R. J. Östergård, There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of K_{14}, arXiv:0801.0202 [math.CO], 2007.
Joseph Malkevitch, Mathematics and Sports
Brendan D. McKay and Ian M. Wanless, Enumeration of Latin squares with conjugate symmetry, arXiv:2104.07902 [math.CO], 2021. Table 5 p. 15.
Index entries for sequences related to tournaments
|
