二部竞赛图中的最长圈问题

Longest cycle problem in the two tournaments

证明了以下结论:对于一个p×q阶二部竞赛图T,如果T(p,q)满足L(n)条件且强连通,则T包含一条长至少为2min{n+1,p,q}的圈,除非T同构于一类特殊的图族。

We demonstrate the following conclusions： for a p×q-order two tournament T, if T（p,q） satisfy the L（n） conditions and is strongly connected then T contain a cycle at least 2min{n＋1,p,q}long, unless T is isomorphic with a kind of graph class.