Countable Menger theorem with finitary matroid constraints on the ingoing edges
Abstract
We present a strengthening of the countable Menger theorem (edge version) of R. Aharoni. Let D=(V,A) be a countable digraph with s≠ t∈ V and let M=v∈ VMv be a matroid on A where Mv is a finitary matroid on the ingoing edges of v . We show that there is a system of edge-disjoint s → t paths P such that the united edge set of the paths is M -independent, and there is a C ⊂eq A consists of one edge from each element of P for which spanM(C) covers all the s→ t paths in D .
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.