16 citations · 81 across the 23 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023★ 1 cited
The -Game
Nathan Bowler, Florian Gut
We investigate a two player game called the -building game: two players alternately claim edges of an infinite complete graph. Each player's aim is to claim all six edges on s…
math.CO2023
Menger's Theorem in bidirected graphs
Nathan Bowler, Ebrahim Ghorbani, Florian Gut +2
Bidirected graphs are a generalisation of directed graphs that arises in the study of undirected graphs with perfect matchings. Menger's famous theorem - the minimum size of a set…
math.CO2023★ 1 cited
Decomposition of (infinite) digraphs along directed 1-separations
Nathan Bowler, Florian Gut, Meike Hatzel +3
We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the s…