3 papers
math.CO2026
On the Possibilities of Defining Infinite Oriented Matroids
Nathan Bowler, Winfried Hochstättler, Stefan Kaspar
Is it possible to define cryptomorphic axiom systems for infinite oriented matroids by lifting some of the axiom systems for finite oriented matroids to the infinite setting while…
math.CO2025
A structure theorem for rooted connectivity in bidirected graphs
Tara Abrishami, Nathan Bowler, Attila Joó +2
Recently, bidirected graphs have received increasing attention from the graph theory community with both structural and algorithmic results. Bidirected graphs are a generalization…
math.CO2024
Hitting cycles through prescribed vertices or edges
Nathan Bowler, Ebrahim Ghorbani, Florian Gut +2
We prove that for every set of vertices of a directed graph , the maximum number of vertices in contained in a collection of vertex-disjoint cycles in is at least th…