Countable Menger's Theorem with Finitary Matroid Constraints on the Ingoing Edges

Electronic Journal Of Combinatorics

Attila Joó¹ 

关键词: Menger';    s theorem;    Matroid;    Infinite graph;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We present a strengthening of the countable Menger's theorem of R. Aharoni. 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 mat

【 授权许可】

Others