2011/01/28 by Henning Bruhn, Bruhn, Henning, Paul Wollan +1
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1101.5621
16 pages
arxiv created 2011/01/28 · openalex publication_date 2011/01/28 · arxiv updated 2011/01/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid, such as submodularity and invariance under duality. As an application we use it to extend Tutte's linking theorem to finitary and to co-finitary matroids.