Packing directed circuits exactly
Bertrand Guenin, Robin B. Thomas · arXiv (Cornell University) · 2010
We give an "excluded minor" and a "structural" characterization of digraphs D that have the property that for every subdigraph H of D, the maximum number of disjoint circuits in H is equal to the minimum cardinality of a subset T of V(H) such that H\T is acyclic.