1,4

CRC Handbook of Combinatorial Designs (see pages 655, 720-723).

Dinitz, Jeffrey H.; Garnick, David K.; McKay, Brendan D.; 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. Ostergard, There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of K_{14}, Journal of Combinatorial Designs, to appear.

Seah, E. and Stinson, D. R., 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 J. H. Dinitz and D R. Stinson, Contemporary Design Theory, Wiley, 1992.

Petteri Kaski and Patric R. J. Ostergard, There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of K_{14}

Index entries for sequences related to tournaments

a(n) ~ exp(2n^2 log(2n)) as n -> infinity (see CRC Handbook, p. 655, Theorem 4.20).

Cf. A000438.

Sequence in context: A162137 A119645 A058807 this_sequence A029591 A151578 A159015

Adjacent sequences: A000471 A000472 A000473 this_sequence A000475 A000476 A000477

nonn,hard,nice

N. J. A. Sloane (njas(AT)research.att.com).

a(7) communicated by Vesa Linja-aho (vesa.linja-aho(AT)tkk.fi), Aug 02 2008