DISJOINT DIRECTED CYCLES

摘要

It is shown that there exists a positive epsilon SO that for any integer k, every directed graph with minimum outdegree at least k contains at least epsilon k vertex disjoint cycles. On the other hand, for every ii there is a digraph with minimum outdegree k which does not contain two vertex or edge disjoint cycles of the same length. (C) 1996 Academic Press, Inc. [References: 11]