Reconstruction of infinite matroids from their 3-connected minors. (January 2018)

• Record Type: Journal Article
• Authors: Bowler, Nathan; Carmesin, Johannes; Postle, Luke
• Is Part Of: European journal of combinatorics. Volume 67(2018)
• Page Start: 126
• Page End: 144
• Publication Date: 2018-01
• Subjects: Combinatorial analysis -- Periodicals; Analyse combinatoire -- Périodiques; Combinatorial analysis; Periodicals; Electronic journals; 511.6
• DOI: 10.1016/j.ejc.2017.06.007
• Languages: English
• ISSNs: 0195-6698

Abstract

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.