Independent and maximal branching packing in infinite matroid-rooted digraphs
From MaRDI portal
Publication:6286192
arXiv1705.01016MaRDI QIDQ6286192FDOQ6286192
Authors: Attila Joó 
Publication date: 2 May 2017
Abstract: We prove a common generalization of the maximal independent arborescence packing theorem of Cs. Kir'aly and two of our earlier works about packing branchings in infinite digraphs.
This page was built for publication: Independent and maximal branching packing in infinite matroid-rooted digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286192)
