On the Enumeration of Walecki Tournaments When m Is Odd
Lian Guang · Journal of Nanjing Polytechnic College · 2003
The concepts of strong latin square and strong latin moment are introduced in this paper. There are 1440 Walecki tournaments when m =3. We conjecture that the number of Walecki tournaments of order 2m+1 is ( 2m)!·Φ(m) when m≥3 and odd in whichΦ(m)=1+2 (m-1)/2 -1[2 (m-1)/2 -2] 2{[2 (m-1)/2 -1] m-1 -(m-1)·2 (m-1)/2 +2m-3}.