
REFERENCES

CRC Handbook of Combinatorial Designs (see pages 655, 720723).
Dinitz, Jeffrey H.; Garnick, David K.; McKay, Brendan D.; There are 526,915,620 nonisomorphic onefactorizations of K_{12}. J. Combin. Des. 2 (1994), no. 4, 273285.
N. T. Gridgeman, Latin Squares Under Restriction and a Jumboization, J. Rec. Math., 5 (1972), 198202.
Hartman, Alan and Rosa, Alexander, Cyclic onefactorization of the complete graph. European J. Combin. 6 (1985), no. 1, 4548.
W. D. Wallis, 1Factorizations of complete graphs, pp. 593631 in J. H. Dinitz and D R. Stinson, Contemporary Design Theory, Wiley, 1992.
D. V. Zinoviev, On the number of 1factorizations of a complete graph [in Russian], Problemy Peredachi Informatsii, 50 (No. 4), 2014, 7178.


LINKS

Table of n, a(n) for n=1..7.
Dieter Jungnickel, Vladimir D. Tonchev, Counting Steiner triple systems with classical parameters and prescribed rank, arXiv:1709.06044 [math.CO], 2017.
Mario Krenn, Xuemei Gu, Anton Zeilinger, Quantum Experiments and Graphs: Multiparty States as coherent superpositions of Perfect Matchings, arXiv:1705.06646 [quantph], 2017 and PRL 119 240403. [Mario Krenn said in an email, "We would not have discovered this connection between quantum mechanical experiments and graph theory, thus the physical interpretations and all the generalisations we are developing right now, without you and A000438."]
Index entries for sequences related to tournaments
