Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777336 | European Journal of Combinatorics | 2018 | 19 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nathan Bowler, Johannes Carmesin, Luke Postle,