Florian Gut

collaborators

3 papers

math.CO2026

Maker-Breaker games on infinite graphs with precolored edges

Nathan Bowler, Florian Gut, Henri Ortmüller

Suppose we are given graphs $B$ and $G$ . In the classical Maker-Breaker game $MB (B, G)$ two players, Maker and Breaker, alternately claim edges of $B$ and it is Maker's goal…

math.CO2026

Hitting cycles through prescribed vertices or edges

Nathan Bowler, Ebrahim Ghorbani, Florian Gut +2

We prove that for every set $S$ of vertices of a directed graph $D$ , the maximum number of vertices in $S$ contained in a collection of vertex-disjoint cycles in $D$ is at least th…

math.CO2024

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…