On three zero-sum Ramsey-type problems

For a graph G whose number of edges is divisible by k, let R(G,Zk) denote the minimum integer r such that for every function f: E(Kr) ↦ Zk there is a copy G1 of G in Kr so that Σe∈E(G1) f(e) = 0 (in Zk). We prove that for every integer k1R(Kn, Zk) ≤ n + O(k3 log k) provided n is sufficiently large as a function of k and k divides (). If, in addition, k is an odd prime-power then R(Kn, Zk) ≤ n + 2k - 2 and this is tight if k is a prime that divides n. A related result is obtained for hypergraphs. It is further shown that for every graph G on n vertices with an even number of edges R(G,Z2) ≤ n + 2. This estimate is sharp. © 1993 John Wiley & Sons, Inc.

[1]  Marshall Hall.  A combinatorial problem on abelian groups , 1952 .

[2]  Roy Meshulam.  An uncertainty inequality and zero subsums , 1990, Discret. Math..

[3]  Noga Alon,et al.  Set systems with no union of cardinality 0 modulom , 1991, Graphs Comb..

[4]  Paul D. Seymour,et al.  A simpler proof and a generalization of the zero-trees theorem , 1991, J. Comb. Theory, Ser. A.

[5]  Yair Caro.  ON ZERO SUM RAMSEY NUMBERS—COMPLETE GRAPHS , 1992 .

[6]  Noga Alon,et al.  Every 4-regular graph plus an edge contains a 3-regular subgraph , 1984, Journal of combinatorial theory. Series B (Print).

[7]  Yair Caro.  On zero-sum Ramsey numbers - stars , 1992, Discret. Math..

[8]  Wolfgang M. Schmidt,et al.  Diophantine problems in variables restricted to the values 0 and 1 , 1980 .

[9]  William M. Kantor,et al.  Automorphism groups of designs , 1969 .

[10]  Noga Alon,et al.  Regular subgraphs of almost regular graphs , 1984, J. Comb. Theory, Ser. B.

[11]  Yair Caro.  On zero-sum delta-systems and multiple copies of hypergraphs , 1991, J. Graph Theory.

[12]  Zoltán Füredi,et al.  On zero-trees , 1992, J. Graph Theory.

[13]  A. Ziv,et al.  Theorem in the Additive Number Theory , 2022 .

[14]  Arie Bialostocki,et al.  On the Erdös-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings , 1992, Discret. Math..

[15]  Paul D. Seymour,et al.  Spanning Trees of Different Weights , 1990, Polyhedral Combinatorics.

[16]  Frank Harary,et al.  Graph Theory , 2016 .

[17]  John E. Olson,et al.  A combinatorial problem on finite Abelian groups, I , 1969 .