On packing spanning arborescences with matroid constraint
Let D = (V + s, A) be a digraph with a designated root vertex S. Edmonds’ seminal result (see J. Edmonds ) implies that D has a packing of k spanning s-arborescences if and only if D has a packing of k (s, t)-paths for all t ∈ V, where a packing means arc-disjoint subgraphs. Let M be a matroid on the set of arcs leaving S. A packing of (s,t) -paths is called M-based if their arcs leaving S form a base of M while a packing of s-arborescences is called M -based if, for all t ∈ V, the packing of (s, t) -paths provided by the arborescences is M -based. Durand de Gevigney, Nguyen, and Szigeti proved in  that D has an M-based packing of s -arborescences if and only if D has an M-based packing of (s,t) -paths for all t ∈ V. Bérczi and Frank conjectured that this statement can be strengthened in the sense of Edmonds’ theorem such that each S -arborescence is required to be spanning. Specifically, they conjectured that D has an M -based packing of spanning S -arborescences if and only if D has an M -based packing of (s,t) -paths for all t ∈ V. In this paper we disprove this conjecture in its general form and we prove that the corresponding decision problem is NP-complete. We also prove that the conjecture holds for several fundamental classes of matroids, such as graphic matroids and transversal matroids. For all the results presented in this paper, the undirected counterpart also holds.
|Keywords||Connectivity, Edmonds’ branching theorem, Matroid, Packing arborescences|
|Journal||Journal of Graph Theory|
Fortier, Q, Király, C, Szigeti, Z, & Tanigawa, S.-I. (2019). On packing spanning arborescences with matroid constraint. Journal of Graph Theory, 1–23. doi:10.1002/jgt.22484