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 2017Show all

3 papers · 1 filter

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…

math.CO2017★ 1 cited

A note on diameter-Ramsey sets

Jan Corsten, Nóra Frankl

A finite set $A \subset R^{d}$ is called $diameter-Ramsey$ if for every $r \in N$ , there exists some $n \in N$ and a finite set $B \subset \mathbb{R…

math.CO2017★ 3 cited

Balanced supersaturation for some degenerate hypergraphs

Jan Corsten, Tuan Tran

A classical theorem of Simonovits from the 1980s asserts that every graph $G$ satisfying $e (G) ≫ v (G)^{1 + 1/ k}$ must contain $≳ (\frac{e ( G )}{v ( G )})^{2 k}$ copies…