The structure of 2-separations of infinite matroids
Combinatorics
2015-06-08 v2
Abstract
Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits, and the edges of T correspond to certain nested 2-separations of M. These decompositions are invariant under duality.
Cite
@article{arxiv.1201.1135,
title = {The structure of 2-separations of infinite matroids},
author = {Elad Aigner-Horev and Reinhard Diestel and Luke Postle},
journal= {arXiv preprint arXiv:1201.1135},
year = {2015}
}
Comments
31 pages