|
We prove a common generalization of the maximal independent arborescence packing theorem of Cs. Király \cite{kiraly2013maximal} (which itself is a common generalization of the reachability based arborescence packing result \cite{kamiyama2009arc} and a matroid based arborescence packing result \cite{de2013matroid}) and two of our earlier works about packing branchings in infinite digraphs, namely \cite{joo2015edmonds} and \cite{fenyo2}.
Bibtex entry:
| AUTHOR | = | {Jo{\'o}, Attila}, |
| TITLE | = | {Independent and maximal branching packing in infinite matroid-rooted digraphs}, |
| NOTE | = | {{\tt www.cs.elte.hu/egres}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2017}, |
| NUMBER | = | {TR-2017-03} |