|
Search: id:A120489
|
|
|
| A120489 |
|
Number of nonisomorphic perfect 1-factorizations of complete bipartite graph K_{n,n}. |
|
+0
2
|
| |
|
|
OFFSET
|
0,7
|
|
|
COMMENT
|
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
I. M. Wanless, Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles, Electron. J. Combin. 6 (1999) R9.
|
|
CROSSREFS
|
Cf. A120488.
Adjacent sequences: A120486 A120487 A120488 this_sequence A120490 A120491 A120492
Sequence in context: A009665 A053552 A009548 this_sequence A012445 A012450 A097173
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Jul 22 2006
|
|
EXTENSIONS
|
Definition corrected by Ian Wanless, Apr 01 2008
|
|
|
Search completed in 0.002 seconds
|
