On a problem concerning ${\mathbb{Z}}_3$-Ramsey numbers

Cheng Chi, Jialin He

For a graph $G$ with $3\mid e(G)$, let $R(G,{\mathbb{Z}}_3)$ denote the least integer $N$ such that every edge weighting $w:E(K_N)\to {\mathbb{Z}}_3$ admits a copy of $G$ whose edge weigh…