Size-Ramsey numbers of tight paths (2507.01498v1)

Abstract: The $s$-colour size-Ramsey number of a hypergraph $H$ is the minimum number of edges in a hypergraph $G$ whose every $s$-edge-colouring contains a monochromatic copy of $H$. We show that the $s$-colour size-Ramsey number of the $r$-uniform tight path on $n$ vertices is linear in $n$, for every fixed $r$ and $s$, thereby answering a question of Dudek, La Fleur, Mubayi and R\"odl (2017).