16 citations · 81 across the 23 of their papers we have counts for
34 papers
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…
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…
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…
Maker-Breaker games on and
Nathan Bowler, Florian Gut, Attila Joó +1
We investigate Maker-Breaker games on graphs of size in which Maker's goal is to build a copy of the host graph. We establish a firm dependence of the outcome of the gam…
Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions
Nathan Bowler, Christian Elbracht, Joshua Erde +4
A graph is said to be ubiquitous, if every graph that contains arbitrarily many disjoint -minors automatically contains infinitely many disjoint -minors. The well-kno…
The Game: Vertex Colouring
Nathan Bowler, Marit Emde, Florian Gut
We investigate games played between Maker and Breaker on an infinite complete graph whose vertices are coloured with colours from a given set, each colour appearing infinitely ofte…