Yeo于1999年提出猜想:每一个至少有8个点的c-部(c≥4)正则竞赛图D包含一对不相交的长分别为t和|V(D)|-t的共轭圈,其中t∈{3,4,…,|V(D)|-t}.文章证明当c≥9时猜想对于t=6是成立的.
In 1999,Yeo conjectured that each regular c-partite tournament D with c≥4 and |V(D)|≥8 contains a pair of vertex disjoint cycles of length t and |V(D)|-t,for all t∈{3,4,…,|V(D)|-t}.This paper proves that conjecture is valid for the case c ≥9 and t=6.