对B.Alspach在1989年关于竞赛图计数问题[2]本文提出如下猜想:当m≥3的奇数时2m+1阶的Walecki竞赛图的个数是(2m)!Ф(m),其中Ф(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}.%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) whenm≥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}.
展开▼
