4 papers · 1 filter
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…
Circuit-partition of infinite matroids
Nathan Bowler, Attila Joó
Komjáth, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in th…
Connectoids II: existence of normal trees
Nathan Bowler, Florian Reich
In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed g…
Connectoids I: a universal end space theory
Nathan Bowler, Florian Reich
In this series we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects like undirected graphs, directed graph…