10 citations · 23 across the 7 of their papers we have counts for
10 papers
A robust Corrádi--Hajnal Theorem
Peter Allen, Julia Böttcher, Jan Corsten +5
For a graph and , we denote by the random sparsification of obtained by keeping each edge of independently, with probability . We show that there ex…
Tiling edge-coloured graphs with few monochromatic bounded-degree graphs
Jan Corsten, Walner Mendonça
We prove that for all integers , there is a constant such that the following is true for every sequence of graphs w…
Density of monochromatic infinite subgraphs II
Jan Corsten, Louis DeBiasio, Paul McKenney
In 1967, Gerencsér and Gyárfás proved a result which is considered the starting point of graph-Ramsey theory: In every 2-coloring of there is a monochromatic path on $\lceil(…
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 and previously unclaimed edges of . Maker wins if she succeeds in cl…
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 with , the vertices of every -edge-coloured countably infin…
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 and , the vertices of every -edge-coloured complete -uniform hypergraph can be partitioned i…