Publications (48)
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…
A note on uncountably chromatic graphs
Nathan Bowler, Max Pitz
We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.
Bounding the cop number of a graph by its genus
Nathan Bowler, Joshua Erde, Florian Lehner +1
It is known that the cop number of a connected graph can be bounded as a function of the genus of the graph . The best known bound, that $c(G) \leq \left\lfloor \f…
Torsoids in Path-Like Graphs without nontrivial even 2-separation
Nathan Bowler, Florian Reich, Qiuzhenyu Tao
Bowler et al. introduced the concept of torsoids that describes the 1-separations of a directed graph in a canonical way building on previous progress by Lov{á}sz. To fully unders…
Separations of sets
Nathan Bowler, Jay Lilian Kneip
Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize th…
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.