Disjoint directed cycles

Research output: Contribution to journalArticlepeer-review

36 Scopus citations


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 languageEnglish (US)
Pages (from-to)167-178
Number of pages12
JournalJournal of Combinatorial Theory. Series B
Issue number2
StatePublished - Nov 1996
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Disjoint directed cycles'. Together they form a unique fingerprint.

Cite this