no. 16 · Tuesday 17 November 2026
Zero-sum Ramsey numbers of forests, cycles and complete bipartite graphs
Abstract
For a graph $G$ and $m\ge2$ dividing $e(G)$, the zero-sum Ramsey number $R(G,\mathbb Z_m)$ is the least $N$ such that every $\mathbb Z_m$-labeling of $E(K_N)$ contains a copy of $G$ whose edge labels sum to zero. We disprove the Bialostocki–Dierker asymptotic conjecture for forests by constructing trees for every sufficiently large edge count whose ratio of zero-sum to two-color Ramsey numbers has lower limit at least $554/553>1$. For powers of two $q\ge2$, we characterize all $s,k\ge1$ satisfying $R(K_{s,kq},\mathbb Z_q)=s+kq$ and prove $R(mK_{q,q},\mathbb Z_m)=2qm+m/\gcd(m,q)-1$ for every $m\ge2$. The packing upper bound combines Caro's transfer inequality with our spanning result and sharpens earlier bounds when $\gcd(m,q)\ge4$. The formula also gives exact values for counterexamples to Caro's defect conjecture, whose failure was already implicit in earlier work of Caro and Caro–Provstgaard. For every integer $m\ge2$ and every multiple $\ell$ of $m$ with $\ell\ge100m^3$, we also prove $R(C_\ell,\mathbb Z_m)=\ell+m/\gcd(m,2)-1$ for the cycle $C_\ell$ on $\ell$ vertices, determining the eventual value left by the bounds of Chi and He for even moduli $m\ge4$.
- comments
- 17 pages
- fields
- Combinatorics