Abstract
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 language | English (US) |
---|---|
Pages (from-to) | 535-554 |
Number of pages | 20 |
Journal | Combinatorica |
Volume | 16 |
Issue number | 4 |
DOIs | |
State | Published - 1996 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Computational Mathematics