Packing directed circuits

Bruce Reed, Neil Robertson, Paul Seymour, Robin Thomas

Research output: Contribution to journalArticle

63 Scopus citations


We prove a conjecture of Younger, that for every integer n ≥ 0 there exists an integer t ≥ 0 such that for every digraph G, either G has n vertex-disjoint directed circuits, or G can be made acyclic by deleting at most t vertices.

Original languageEnglish (US)
Pages (from-to)535-554
Number of pages20
Issue number4
StatePublished - 1996

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Packing directed circuits'. Together they form a unique fingerprint.

  • Cite this

    Reed, B., Robertson, N., Seymour, P., & Thomas, R. (1996). Packing directed circuits. Combinatorica, 16(4), 535-554.