J. Corsten

most citedA robust CorrÃ¡di--Hajnal Theorem

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

collaborators

2 papers

math.CO2026★ 1 cited

A robust CorrÃ¡di--Hajnal Theorem

Peter Allen, Julia BÃ¶ttcher, Jan Corsten +5

For a graph $G$ and $p \in [0, 1]$ , we denote by $G_{p}$ the random sparsification of $G$ obtained by keeping each edge of $G$ independently, with probability $p$ . We show that there ex…

math.CO2025

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 $K_{n}$ there is a monochromatic path on $\lce…