On Maximal Independent Arborescence Packing

  title={On Maximal Independent Arborescence Packing},
  author={Csaba Kir{\'a}ly},
  journal={SIAM J. Discrete Math.},
In this paper, we generalize the results of Kamiyama, Katoh and Takizawa [7] to solve the following problem. Given a digraph D = (V,A) and a matroid on an abstract set S = {s1, . . . , sk} along with a map π : S → V ; give k edgedisjoint arborescences T1, . . . , Tk with roots π(s1), . . . , π(sk) such that for any v ∈ V the set {si : v ∈ Ti} is independent and its rank reaches the theoretical maximum. We also give a simplified proof for the result of Fujishige [5] from the result of Kamiyama… CONTINUE READING