16 citations · 81 across the 23 of their papers we have counts for
4 papers · 2 filters
Infinite graphic matroids Part I
Nathan Bowler, Johannes Carmesin, Robin Christian
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any circuit with any cocircuit is finite. We show that a matroid is graphic if and on…
Edge-disjoint double rays in infinite graphs: a Halin type result
Nathan Bowler, Johannes Carmesin, Julian Pott
We show that any graph that contains k edge-disjoint double rays for any k>0 contains also infinitely many edge-disjoint double rays. This was conjectured by Andreae in 1981.
The ubiquity of Psi-matroids
Nathan Bowler, Johannes Carmesin
Solving (for tame matroids) a problem of Aigner-Horev, Diestel and Postle, we prove that every tame matroid M can be reconstructed from its canonical tree decomposition into 3-conn…
Infinite Matroids and Determinacy of Games
Nathan Bowler, Johannes Carmesin
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…