A linear upper bound on the zero-sum Ramsey number of forests in ${\mathbb{Z}}_p$

Lucas Colucci, Marco D'Emidio

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