Answers are grounded in this paper and cite their sources.
For a graph G and an integer m≥2 dividing $e(G)$, where $e(G)$ denotes the number of edges of G, the zero-sum Ramsey number R(G, Zₘ) is the least N such that every Zₘ-labeling of E(KN) contains a copy of G whose edge labels sum to zero. Bialostocki and Dierker (1990) [4] conjectured that R(F, Ze(F))/R(F,2)→1 uniformly over all forests F as e(F)→∞, where $R(F,2)$ is the two-color Ramsey number, and Caro (1991) [9] conjectured that R(tG, Zₜ)=t(|V(G)|+d)-d for t≥2 disjoint copies of G, where d=defₜ(G) is the defect. We disprove the first conjecture by an infinite family of trees. Building on the work of Caro and on his joint work with Provstgaard, we obtain infinitely many counterexamples to the second conjecture, and we determine the zero-sum Ramsey numbers of a class of graphs: for powers of two q≥2 we characterize all s,k≥1 satisfying R(Ks,kq, Zq)=s+kq, and we prove R(mKq,q, Zₘ)=2qm+m/(m,q)-1 for every m≥2.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: