Basic Packing of Arborescences: A Digraph with Roots Has an M-Basic Packing of Arborescences iff π Is M-Independent and D Is M-ConnectedResearch Paper
Packing arc-disjoint arborescences is one of the basic tractable problems of combinatorial optimization. Edmonds' branching theorem (1973) says that a digraph contains arc-disjoint spanning arborescences rooted at a vertex if and only if every non-empty vertex set is entered by at least arcs. Its undirected counterpart…