The size-Ramsey number of powers of paths

Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa +4

Given graphs $G$ and $H$ and a positive integer $q$ say that $G$ is $q$-Ramsey for $H$, denoted $G\to (H{)}_q$, if every $q$-colouring of the edges of $G$ contains a monochro…