Ramsey Goodness of Paths in Random Graphs

Luiz Moreira

We say that a graph $G$ is Ramsey for $H_1$ versus $H_2$, and write $G\to (H_1,H_2)$, if every red-blue colouring of the edges of $G$ contains either a red copy of $H_1$ or a blue…