Abstract
It is shown that there exists a positive ε so that for any integer k, every directed graph with minimum outdegree at least k contains at least εk vertex disjoint cycles. On the other hand, for every k there is a digraph with minimum outdegree k which does not contain two vertex or edge disjoint cycles of the same length.
Original language | English (US) |
---|---|
Pages (from-to) | 167-178 |
Number of pages | 12 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 68 |
Issue number | 2 |
DOIs | |
State | Published - Nov 1996 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics