A120489 Number of nonisomorphic perfect 1-factorizations of complete bipartite graph K_{n,n}.

1, 1, 1, 0, 1, 0, 2, 0, 37, 0

Offset: 0

Author

N. J. A. Sloane, Jul 22 2006

Keywords

• nonn
• more

Comments

a(n) = 0 if n > 2 is even [Wanless].

References

• 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.

Links

• I. M. Wanless, Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles, Electron. J. Combin. 6 (1999) R9.

Crossrefs

Cf. A120488.

Extensions

Definition corrected by Ian Wanless, Apr 01 2008