Infinite graphic matroids
N Bowler, J Carmesin, R Christian - Combinatorica, 2018 - Springer
We introduce a class of infinite graphic matroids that contains all the motivating examples
and satisfies an extension of Tutte's excluded minors characterisation of finite graphic …
and satisfies an extension of Tutte's excluded minors characterisation of finite graphic …
Infinite matroids and determinacy of games
N Bowler, J Carmesin - arXiv preprint arXiv:1301.5980, 2013 - arxiv.org
Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These
can be used to provide counterexamples against the natural extension of the Well-quasi …
can be used to provide counterexamples against the natural extension of the Well-quasi …
Graph‐like compacta: Characterizations and Eulerian loops
B Espinoza, P Gartside, M Pitz - Journal of Graph Theory, 2020 - Wiley Online Library
A compact graph‐like space is a triple (X, V, E), where X is a compact, metrizable space, V⊆
X is a closed zero‐dimensional subset, and E is an index set such that X⧹ V≅ E×(0, 1). New …
X is a closed zero‐dimensional subset, and E is an index set such that X⧹ V≅ E×(0, 1). New …
[HTML][HTML] Dual trees must share their ends
R Diestel, J Pott - Journal of Combinatorial Theory, Series B, 2017 - Elsevier
We extend to infinite graphs the matroidal characterization of finite graph duality, that two
graphs are dual iff they have complementary spanning trees in some common edge set. The …
graphs are dual iff they have complementary spanning trees in some common edge set. The …
[HTML][HTML] Topological cycle matroids of infinite graphs
J Carmesin - European Journal of Combinatorics, 2017 - Elsevier
Topological cycle matroids of infinite graphs - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue Search …
[HTML][HTML] The structure of 2-separations of infinite matroids
Generalizing a well known theorem for finite matroids, we prove that for every (infinite)
connected matroid M there is a unique tree T such that the nodes of T correspond to minors …
connected matroid M there is a unique tree T such that the nodes of T correspond to minors …
Infinite trees of matroids
N Bowler, J Carmesin - arXiv preprint arXiv:1409.6627, 2014 - arxiv.org
arXiv:1409.6627v1 [math.CO] 23 Sep 2014 Page 1 arXiv:1409.6627v1 [math.CO] 23 Sep 2014
Infinite trees of matroids Nathan Bowler and Johannes Carmesin December 4, 2021 Abstract …
Infinite trees of matroids Nathan Bowler and Johannes Carmesin December 4, 2021 Abstract …
Path spaces I: A Menger-type result
H Heine - arXiv preprint arXiv:2007.09709, 2020 - arxiv.org
Infinite graphs are finitary in the sense that their points are connected via finite paths. So
what would an infinitary generalization of finite graphs look like? Usually this question is …
what would an infinitary generalization of finite graphs look like? Usually this question is …
Dual trees must share their ends
R Diestel, J Pott - arXiv preprint arXiv:1106.1324, 2011 - arxiv.org
We extend to infinite graphs the matroidal characterization of finite graph duality, that two
graphs are dual iff they have complementary spanning trees in some common edge set. The …
graphs are dual iff they have complementary spanning trees in some common edge set. The …
The structure of 2-separations of infinite matroids
Generalizing a well known theorem for finite matroids, we prove that for every (infinite)
connected matroid M there is a unique tree T such that the nodes of T correspond to minors …
connected matroid M there is a unique tree T such that the nodes of T correspond to minors …