证明了若有向二部图D=(V1,V2:A)的最小度至少为5尼,则D有k个顶点不交的独立有向6-圈.其中|V1|=|V2|=3k,k为整数。
LetD = (V1, V2:A)beadirectedbipartitegraph with |V1|=|V2|=3k, wherekisa positive integer. We show that if the minimum degree of D is at least 5k, then D contains k disjoint directed 6-cycles.