3 citations · 6 across the 3 of their papers we have counts for
3 papers
math.CO2014★ 2 cited
Infinite trees of matroids
Nathan Bowler, Johannes Carmesin
We generalise the construction of infinite matroids from trees of matroids to allow the matroids at the nodes, as well as the field over which they are represented, to be infinite.
math.CO2012★ 1 cited
Matroid intersection, base packing and base covering for infinite matroids
Nathan Bowler, Johannes Carmesin
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infi…
math.CO2012★ 3 cited
Matroids with an infinite circuit-cocircuit intersection
Johannes Carmesin, Nathan Bowler
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answers a question of Bruhn, Diestel, Kriesell, Pendavingh and Wollan. It further sh…