摘要
A. tournament T = (V, A) is said to be arc-h-cyclic. If for every are e∈A, there is a circuit of length h containing e. When |Ⅴ| =p, an arc-pcyclic tournament is also said to be are-Hamiltonian. Shao Pingzhong and Zhang Cunquan made a conjecture on the Second Chinese Conference on Graph Theory that an arc-Hamiltonian tournament is are k-cyclic, k=h, h+1,…, p, where 4≤h≤p-1.
