On a problem of Caro on ${\mathbb{Z}}_3$-Ramsey number of forests

José D. Alvarado, Lucas Colucci, Roberto Parente

Let $k$ be a positive integer and let $G$ be a graph. The zero-sum Ramsey number $R(G,{\mathbb{Z}}_k)$ is the least integer $N$ (if it exists) such that for every edge-coloring $χ\,…