The multicolour size-Ramsey number of powers of paths

Jie Han, Matthew Jenssen, Yoshiharu Kohayakawa +2

Given a positive integer $s$, a graph $G$ is $s$-Ramsey for a graph $H$, denoted $G\to (H{)}_s$, if every $s$-colouring of the edges of $G$ contains a monochromatic copy of $…