A linear upper bound on zero-sum Ramsey numbers of $d$-degenerate graphs in $\mathbb{Z}_p$
Combinatorics
2026-04-14 v1
Abstract
Let be a prime number and let be a graph on vertices and edges. The zero-sum Ramsey number of over , denoted by , is the minimum such that for any edge-coloring , there is a subgraph isomorphic to and satisfying . We prove that if is a -degenerate graph, then so long as , divides , and . This generalizes a result by Colucci and D'Emidio on -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}
}