On the Kohayakawa-Kreuter conjecture

Eden Kuperwasser, Wojciech Samotij, Yuval Wigderson

Let us say that a graph $G$ is Ramsey for a tuple $(H_1,\dots ,H_r)$ of graphs if every $r$-coloring of the edges of $G$ contains a monochromatic copy of $H_i$ in color $i$, for som…