Ramsey Goodness of Paths in Random Graphs

30 Aug 2019 Moreira Luiz

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 copy of $H_2$. In this paper we study the threshold for the event that the Erd\H{o}s--R\'enyi random graph $G(N,p)$ is Ramsey for a clique versus a path... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS