Independent and maximal branching packing in infinite matroid-rooted digraphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.