9 citations · 22 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2013★ 5 cited
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…
math.CO2013★ 9 cited
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…
math.CO2012★ 8 cited
An excluded minors method for infinite matroids
Nathan Bowler, Johannes Carmesin
The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite…