A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs

Deepak Bal, Louis DeBiasio, Allan Lo

The $r$-color size-Ramsey number of a $k$-uniform hypergraph $H$, denoted by ${\hat{R}}_r(H)$, is the minimum number of edges in a $k$-uniform hypergraph $G$ such that for every $r$-…