On three open problems in zero-sum Ramsey numbers

Cheng Chi, Jialin He, Quan Sun

Let $K_N^{(r)}$ denote the $N$-vertex complete $r$-uniform hypergraph. For an $r$-uniform hypergraph $H$ and an integer $k\ge 2$, the $k$-color Ramsey number $R(H,k)$ is the least…