Independent and maximal branching packing in infinite matroid-rooted digraphs
arXiv:1705.01016
Abstract
We prove a common generalization of the maximal independent arborescence packing theorem of Cs. Király and two of our earlier works about packing branchings in infinite digraphs.
arXiv comment26 pages