Packing directed circuits exactly
Combinatorics
2010-12-14 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.1012.2749,
title = {Packing directed circuits exactly},
author = {Bertrand Guenin and Robin Thomas},
journal= {arXiv preprint arXiv:1012.2749},
year = {2010}
}
Comments
To appear in Combinatorica