Topological cycle matroids of infinite graphs

Johannes Carmesin

doi:10.1016/j.ejc.2016.09.008

Topological cycle matroids of infinite graphs

Johannes Carmesin

Mathematics

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

1 Citation (Scopus)

131 Downloads (Pure)

Abstract

We prove that the topological cycles of an arbitrary infinite graph induce a matroid. This matroid in general is neither finitary nor cofinitary.

Original language	English
Pages (from-to)	135-150
Journal	European Journal of Combinatorics
Volume	60
Early online date	21 Oct 2016
DOIs	https://doi.org/10.1016/j.ejc.2016.09.008
Publication status	Published - Feb 2017

Bibliographical note

arXiv admin note: substantial text overlap with arXiv:1409.6640

Keywords

math.CO
05C63, 05B35, 03E60

Access to Document

10.1016/j.ejc.2016.09.008

1412.0830v1Submitted manuscript, 371 KB

https://www.repository.cam.ac.uk/handle/1810/264606Licence: Creative Commons: Attribution-NonCommercial-NoDerivs (CC BY-NC-ND)

Cite this

@article{db65942b125b42399708584f452a89bb,

title = "Topological cycle matroids of infinite graphs",

abstract = "We prove that the topological cycles of an arbitrary infinite graph induce a matroid. This matroid in general is neither finitary nor cofinitary. ",

keywords = "math.CO, 05C63, 05B35, 03E60",

author = "Johannes Carmesin",

note = "arXiv admin note: substantial text overlap with arXiv:1409.6640",

year = "2017",

month = feb,

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

language = "English",

volume = "60",

pages = "135--150",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Elsevier",

}

TY - JOUR

T1 - Topological cycle matroids of infinite graphs

AU - Carmesin, Johannes

N1 - arXiv admin note: substantial text overlap with arXiv:1409.6640

PY - 2017/2

Y1 - 2017/2

N2 - We prove that the topological cycles of an arbitrary infinite graph induce a matroid. This matroid in general is neither finitary nor cofinitary.

AB - We prove that the topological cycles of an arbitrary infinite graph induce a matroid. This matroid in general is neither finitary nor cofinitary.

KW - math.CO

KW - 05C63, 05B35, 03E60

U2 - 10.1016/j.ejc.2016.09.008

DO - 10.1016/j.ejc.2016.09.008

M3 - Article

SN - 0195-6698

VL - 60

SP - 135

EP - 150

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

ER -

Topological cycle matroids of infinite graphs

Abstract

Bibliographical note

Keywords

Access to Document

Fingerprint

Cite this