J. Corsten

most citedA note on the grid Ramsey problem

1 citations · 1 across the 1 of their papers we have counts for

collaborators

3 papers

math.CO2019

On the Odd Cycle Game and Connected Rules

Jan Corsten, Adva Mond, Alexey Pokrovskiy +2

We study the positional game where two players, Maker and Breaker, alternately select respectively $1$ and $b$ previously unclaimed edges of $K_{n}$ . Maker wins if she succeeds in cl…

math.CO2019

Partitioning infinite hypergraphs into few monochromatic Berge-paths

Sebastián Bustamante, Jan Corsten, Nóra Frankl

Extending a result of Rado to hypergraphs, we prove that for all $s, k, t \in N$ with $k \geq t \geq 2$ , the vertices of every $r = s (k - t + 1)$ -edge-coloured countably infin…

math.CO2017★ 1 cited

A note on the grid Ramsey problem

Jan Corsten

The grid Ramsey number $G (r)$ is the smallest number $n$ such that every edge-colouring of the grid graph $Γ_{n, n} := K_{n} \times K_{n}$ with $r$ colours induces a rectangle whose…