The size-Ramsey number of powers of bounded degree trees

Sören Berger, Yoshiharu Kohayakawa, Giulia Satiko Maesaka +4

Given a positive integer $s$, the $s$-colour size-Ramsey number of a graph $H$ is the smallest integer $m$ such that there exists a graph $G$ with $m$ edges with the property that,…