English

A linear upper bound on zero-sum Ramsey numbers of $d$-degenerate graphs in $\mathbb{Z}_p$

Combinatorics 2026-04-14 v1

Abstract

Let pp be a prime number and let GG be a graph on nn vertices and mm edges. The zero-sum Ramsey number of GG over Zp\mathbb{Z}_p, denoted by R(G,Zp)R(G, \mathbb{Z}_p), is the minimum N\ell\in \mathbb{N} such that for any edge-coloring c:E(K)Zpc:E(K_\ell)\to\mathbb{Z}_p, there is a subgraph GKG'\subset K_\ell isomorphic to GG and satisfying eE(G)c(e)=0\sum_{e\in E(G')}c(e)=0. We prove that if GG is a dd-degenerate graph, then R(G,Zp)n+(3+3d)pR(G, \mathbb{Z}_p)\leq n + (3+3d)p so long as m2pd(d+1)2m\geq 2pd(d+1)^2, pp divides mm, and 2d<p2d<p. This generalizes a result by Colucci and D'Emidio on 11-degenerate graphs.

Keywords

Cite

@article{arxiv.2604.10864,
  title  = {A linear upper bound on zero-sum Ramsey numbers of $d$-degenerate graphs in $\mathbb{Z}_p$},
  author = {Andrey Shapiro},
  journal= {arXiv preprint arXiv:2604.10864},
  year   = {2026}
}