J. Corsten

activity

20172022

most citedPartitioning edge-coloured hypergraphs into few monochromatic tight cycles

10 citations · 23 across the 7 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

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.CO2019★ 10 cited

Partitioning edge-coloured hypergraphs into few monochromatic tight cycles

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

Confirming a conjecture of Gyárfás, we prove that, for all natural numbers $k$ and $r$ , the vertices of every $r$ -edge-coloured complete $k$ -uniform hypergraph can be partitioned i…