Reconstruction of infinite matroids from their 3-connected minors
Combinatorics
2016-06-15 v1
Abstract
We show that any infinite matroid can be reconstructed from the torsos of a tree-decomposition over its 2-separations, together with local information at the ends of the tree. We show that if the matroid is tame then this local information is simply a choice of whether circuits are permitted to use that end. The same is true if each torso is planar, with all gluing elements on a common face.
Keywords
Cite
@article{arxiv.1606.04235,
title = {Reconstruction of infinite matroids from their 3-connected minors},
author = {Nathan Bowler and Johannes Carmesin and Luke Postle},
journal= {arXiv preprint arXiv:1606.04235},
year = {2016}
}