4 papers · 1 filter
Maker-Breaker games on infinite graphs with precolored edges
Nathan Bowler, Florian Gut, Henri Ortmüller
Suppose we are given graphs and . In the classical Maker-Breaker game two players, Maker and Breaker, alternately claim edges of and it is Maker's goal…
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…
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…
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…