Matroid and Tutte-Connectivity in Infinite Graphs

Electronic Journal Of Combinatorics

Henning Bruhn¹ 

关键词: Connectivity;    Infinite graphs;    Infinite matroids;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that the two cycle matroids, the finite-cycle matroid and the cycle matroid, in which also infinite cycles are taken into account, have the same connectivity func

【 授权许可】

Others