Countable Menger's theorem with finitary matroid constraints on the ingoing edges (Q1658749)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Countable Menger's theorem with finitary matroid constraints on the ingoing edges
    scientific article

      Statements

      Countable Menger's theorem with finitary matroid constraints on the ingoing edges (English)
      0 references
      0 references
      15 August 2018
      0 references
      Summary: We present a strengthening of the countable Menger's theorem of \textit{R. Aharoni} [J. Comb. Theory, Ser. B 43, 303--313 (1987; Zbl 0631.05032)]. Let \(D=(V,A)\) be a countable digraph with \(s\neq t\in V \) and let \(\mathcal{M}=\bigoplus_{v\in V}\mathcal{M}_v \) be a matroid on \(A\) where \(\mathcal{M}_v\) is a finitary matroid on the ingoing edges of \(v\). We show that there is a system of edge-disjoint \(s \rightarrow t\) paths \(\mathcal{P}\) such that the united edge set of these paths is \(\mathcal{M}\)-independent, and there is a \(C\subseteq A\) consisting of one edge from each element of \(\mathcal{P}\) for which \(\mathsf{span}_{\mathcal{M}}(C)\) covers all the \(s\rightarrow t\) paths in \(D\).
      0 references
      Menger's theorem
      0 references
      matroid
      0 references
      infinite graph
      0 references

      Identifiers