Reconstruction of infinite matroids from their 3-connected minors

Nathan Bowler; Johannes Carmesin; Luke Postle

doi:10.1016/j.ejc.2017.06.007

Reconstruction of infinite matroids from their 3-connected minors

Nathan Bowler, Johannes Carmesin, Luke Postle

Mathematics

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

186 Downloads (Pure)

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.

Original language	English
Pages (from-to)	126-144
Journal	European Journal of Combinatorics
Volume	67
Early online date	15 Aug 2017
DOIs	https://doi.org/10.1016/j.ejc.2017.06.007
Publication status	Published - Jan 2018

Keywords

math.CO
05C63, 05B35

Access to Document

10.1016/j.ejc.2017.06.007

1606.04235v1
Hosted on Arxiv: https://arxiv.org/abs/1606.04235
Submitted manuscript, 546 KBLicence: None: All rights reserved

https://arxiv.org/abs/1606.04235

Cite this

@article{46ee1a5594744e1180024c3c265d62b5,

title = "Reconstruction of infinite matroids from their 3-connected minors",

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 = "math.CO, 05C63, 05B35",

author = "Nathan Bowler and Johannes Carmesin and Luke Postle",

year = "2018",

month = jan,

doi = "10.1016/j.ejc.2017.06.007",

language = "English",

volume = "67",

pages = "126--144",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Elsevier",

}

TY - JOUR

T1 - Reconstruction of infinite matroids from their 3-connected minors

AU - Bowler, Nathan

AU - Carmesin, Johannes

AU - Postle, Luke

PY - 2018/1

Y1 - 2018/1

N2 - 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.

AB - 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.

KW - math.CO

KW - 05C63, 05B35

U2 - 10.1016/j.ejc.2017.06.007

DO - 10.1016/j.ejc.2017.06.007

M3 - Article

SN - 0195-6698

VL - 67

SP - 126

EP - 144

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

ER -

Reconstruction of infinite matroids from their 3-connected minors

Abstract

Keywords

Access to Document

Fingerprint

Cite this