Zero-sum delta-systems and multiple copies of graphs

A main result proved in this paper is the following. Theorem. Let G be a noncomplete graph on n vertices with degree sequence d₁ ≥ d₂ ≥ · · · ≥ d_n and t ≥ 2 be a prime. Let m = gcd{t, d_i − d_j: 1 ≤ i < j ≤ n} and set Then R(tG, ℤ_t) = t(n + d) − d, where R is the zero-sum Ramsey number. This settles, almost completely, problems raised in Bialostocki & Dierker, J Graph Theory, 1994; Y. Caro, J Graph Theory, 1991]. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 207–216, 1999