A note on zero-sum Ramsey numbers of complete graphs

Cheng Chi, Jialin He, Fuhong Ma

For a graph $H$ with $3\mid e(H)$, the zero-sum Ramsey number $R(H,{\mathbb{Z}}_3)$ is the least integer $N$ such that every labeling of the edges of $K_N$ by elements of ${\mathbb{Z}}_3$ contains a c…