|
%I #13 Oct 20 2019 02:54:07
%S 1,1,1,1,1,5,23,3155
%N Number of nonisomorphic perfect 1-factorizations of complete graph K_{2n}.
%D CRC Handbook Combin. Designs, p. 664.
%D Barbara M. Maenhaut, Perfect 1-factorizations of complete and complete bipartite graphs, talk given at 31st Australasian Conf. Combin. Math and Combin. Computing, Alice Springs, 2006.
%D Petrenyuk, L. and Petrenyuk, A.; Intersection of Perfect One-Factorizations of Complete Graphs, Cybernetics 16 (1980), 6-9.
%D Wallis, W. D.; 1-Factorizations of complete graphs, pp. 593-631 in J. H. Dinitz and D R. Stinson, Contemporary Design Theory, Wiley, 1992.
%H Jeffrey H. Dinitz and David K. Garnick, <a href="http://www.emba.uvm.edu/~jdinitz/preprints/per14.pdf">There are 23 Nonisomorphic Perfect One-Factorizations of K_{14}</a>, J. Combin. Des. 4 (1996), no. 1, 1-3.
%H Wallis, W. D.; <a href="http://eom.springer.de/o/o110070.htm">One-factorization of a graph</a>, in Encyclopaedia of Mathematics (ed. Hazewinkel, Michiel), Springer-Verlag, 2002.
%Y Cf. A000438, A000474, A120489.
%K nonn,more
%O 1,6
%A _N. J. A. Sloane_, Jul 22 2006
%E Additional references from David Garnick (dgarnick(AT)gmail.com), Jan 17 2007
%E Edited by _N. J. A. Sloane_ at the suggestion of _Ian Wanless_, Apr 01 2008
%E a(8) from _Ian Wanless_, Oct 20 2019
|
