本文主要证明了对二部图G=(V1,V2,E),|V1|=|V2|=3k,其中k为正整数.若G的最小度至少为2k-1,则G至少包含k-1个独立6圈.
Let G = (V1,V2;E) be a bipartite graph with |V1|= |V2| = 3k, where k is a positive integer. We show that if the minimum degree of G is at least 2k - 1, then G contains at least k - 1 disjoint 6-cycles.