Independent and maximal branching packing in infinite matroid-rooted digraphs

2017/05/02 by Joó, Attila
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/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.

Related

• Basic Packing of Arborescences
• Matroid-reachability-based decomposition into arborescences
• The b-branching problem in digraphs
• Augmenting a hypergraph to have a matroid-based (f,g)-bounded (α,β)-limited packing of rooted hypertrees
• An analogue of Edmonds' Branching Theorem for infinite digraphs