Reconstruction of infinite matroids from their 3-connected minors

Nathan Bowler, Johannes Carmesin, Luke Postle

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
193 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)126-144
JournalEuropean Journal of Combinatorics
Early online date15 Aug 2017
Publication statusPublished - Jan 2018


  • math.CO
  • 05C63, 05B35


Dive into the research topics of 'Reconstruction of infinite matroids from their 3-connected minors'. Together they form a unique fingerprint.

Cite this