Independent and maximal branching packing in infinite matroid-rooted digraphs
Attila Jo\'o
TL;DR
This paper generalizes existing theorems on packing branchings in infinite digraphs, unifying them into a broader framework for matroid-rooted digraphs.
Contribution
It provides a unified theorem that extends the maximal independent arborescence packing to infinite matroid-rooted digraphs.
Findings
Unified theorems for infinite digraphs and matroids
Extension of maximal independent arborescence packing
New theoretical framework for 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Computational Geometry and Mesh Generation