A linear upper bound on the ${\mathbb{Z}}_p$-Ramsey number of graphs with sufficiently large $2$-packing

Emily Heath, Andrew Simmons

Given a positive integer $k$ and graph $G$, the ${\mathbb{Z}}_k$-Ramsey number $R(G,{\mathbb{Z}}_k)$ is the least $N$ (if it exists) such that every coloring $f:E(K_N)\rightarrow \math…