Publications (20)
Edge-disjoint double rays in infinite graphs: a Halin type result
Nathan Bowler, Johannes Carmesin, Julian Pott
The ubiquity of Psi-matroids
Nathan Bowler, Johannes Carmesin
Model theoretic connected components of finitely generated nilpotent groups
Nathan Bowler, Cong Chen, Jakub Gismatullin
Exploring the Boundaries of Monad Tensorability on Set
Nathan Bowler, Sergey Goncharov, Paul Blain Levy +1
Matroids over hyperfields
Matthew Baker, Nathan Bowler
On the intersection conjecture for infinite trees of matroids
Nathan Bowler, Johannes Carmesin
Non-reconstructible locally finite graphs
Nathan Bowler, Joshua Erde, Peter Heinig +2
A counterexample to the reconstruction conjecture for locally finite trees
Nathan Bowler, Joshua Erde, Peter Heinig +2
Infinite graphic matroids Part I
Nathan Bowler, Johannes Carmesin, Robin Christian
Minimal obstructions for normal spanning trees
Nathan Bowler, Stefan Geschke, Max Pitz
Coproducts of Monads on Set
JiÅà Adámek, Nathan Bowler, Paul B. Levy +1
Thin sums matroids and duality
Hadi Afzali, Nathan Bowler
Reconstruction of infinite matroids from their 3-connected minors
Nathan Bowler, Johannes Carmesin, Luke Postle
Infinite Matroids and Determinacy of Games
Nathan Bowler, Johannes Carmesin
Ubiquity in graphs I: Topological ubiquity of trees
Nathan Bowler, Christian Elbracht, Joshua Erde +4
An excluded minors method for infinite matroids
Nathan Bowler, Johannes Carmesin
Infinite trees of matroids
Nathan Bowler, Johannes Carmesin
Matroid intersection, base packing and base covering for infinite matroids
Nathan Bowler, Johannes Carmesin
Matroids with an infinite circuit-cocircuit intersection
Johannes Carmesin, Nathan Bowler
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs
Nathan Bowler, Joshua Erde, Florian Lehner +3