1 citations · 4 across the 10 of their papers we have counts for
5 papers · 1 filter
On the ubiquity of oriented double rays
Florian Gut, Thilo Krill, Florian Reich
A digraph is called ubiquitous if every digraph that contains arbitrarily many vertex-disjoint copies of also contains infinitely many vertex-disjoint copies of . We stu…
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…
The Rational Number Game
Nathan Bowler, Florian Gut
We investigate a game played between two players, Maker and Breaker, on a countably infinite complete graph where the vertices are the rational numbers. The players alternately cla…
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…