The s-colour size-Ramsey number of a hypergraph H is the minimum number of edges in a hypergraph whose every s-colouring contains a monochromatic copy of H. We show that for every r, s and t the s-colour size-Ramsey number of the t-power of a tight r-uniform path on n vertices in linear in n. This answers a question of Dudek, La Fleur, Mubayi and Rödl (2017).

This is joint work with Liana Yepremyan and Alexey Pokrovskiy.