Nathan J. Bowler

collaborators

Showing math.COShow all

4 papers · 1 filter

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.CO2025

Locally interval graphs are circular-arc graphs

Tara Abrishami, Sandra Albrechtsen, Nathan Bowler +2

Circular-arc graphs are graphs that can be represented as intersection graphs of subpaths of a cycle. Interval graphs are graphs that can be represented as intersection graphs of s…

math.CO2025

$R (K_{ℵ_{0}}, K^_{2, 3})$ is a win for Player 1

Nathan Bowler, Henri Ortmüller

The Strong Ramsey game $R (B, G)$ is a two player game with players $P_{1}$ and $P_{2}$ , where $B$ and $G$ are $k$ -uniform hypergraphs for some $k \geq 2$ . $G$ is always finite…

math.CO2025

Drawing strategies in Strong Ramsey games for 3-uniform hypergraphs

Nathan Bowler, Henri Ortmüller

The Strong Ramsey game $R (B, G)$ is a two player game with players $P_{1}$ and $P_{2}$ , where $B$ and $G$ are $k$ -uniform hypergraphs for some $k \geq 2$ . $G$ is always finite…

Maker-Breaker games on infinite graphs with precolored edges

Locally interval graphs are circular-arc graphs

R(Kℵ0​​,K^2,3​) is a win for Player 1

Drawing strategies in Strong Ramsey games for 3-uniform hypergraphs

$R (K_{ℵ_{0}}, K^_{2, 3})$ is a win for Player 1