[1] N. Alon, D. Kleitman, R. Lipton, R. Meshulam, M. Rabin, J. Spencer: Set systems with no unioon of cardinality $0$ modulo $m$. Graphs and Combinatorics 7 (1991), 97–99. DOI 10.1007/BF01788135 | MR 1115129

[2] N. Alon, Y. Caro: On three zero-sum Ramsey-type problems. to appear in Journal of Graph Theorey.. MR 1217393

[3] A. Bialostocki, Y. Caro, Y. Roditty: On zero-sum Turan numbers. Ars Combinatoria 29A (1990), 117–127. MR 1412813

[4] A. Bialostocki, P. Dierker: Zero-sum Ramsey theorems. Congressus Numerantium 70 (1990), 119–130. MR 1041592

[5] A. Bialostocki, P. Dieker: Zero-sum Ramsey numbers—small graphs. Ars Combinatoria 29A (1990 193–198). MR 1412821

[6] A. Bialostocki, P. Dierker: On the Erdös-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings. Discrete Math. in press. MR 1197440

[7] B. Bollobas: Extremal Graph Theory. Academic Press, New York, 1978. MR 0506522 | Zbl 0419.05031

[8] B. Bollobas: Random Graphs. Academic Press, New York, 1985. MR 0809996 | Zbl 0592.05052

[9] Y. Caro: On zero-sum Ramsey numbers—stars. Discrete Mathematics 104 (1992), 1–6. DOI 10.1016/0012-365X(92)90621-L | MR 1171786 | Zbl 0771.05068

[10] Y. Caro: On $q$-divisible hypergraphs. Ars Combinatoria, in press. Zbl 0777.05083

[11] Y. Caro: On zero-sum Turan numbers—stars and cycles. Ars Combinatoria 33 (1992), 193–198. MR 1174842 | Zbl 0771.05054

[12] Y. Caro: On Zero-sum $\Delta $-systems and multiple copies of hypergraphs. Jour. of Graph Theory 15 (1991), 511–521. DOI 10.1002/jgt.3190150505 | MR 1128231 | Zbl 0762.05081

[13] Y. Caro: On zero-sum Ramsey numbers—Complete graphs. Quarterly J. of Mathematics (Oxford) 43 (1992), 175–181. DOI 10.1093/qmath/43.2.175 | MR 1164621 | Zbl 0771.05069

[14] P. Erdös, A. Ginzburg, A. Ziv: Theorem in the additive number theory. Bull. Research Council Israel 10F (1961), 41–43.

[15] R. Graham, B. Rothschild, J. Spencer: Ramsey Theory, Second edition. John Wiley, New York, 1990. MR 1044995

[16] L. Schrijver, P. D. Seymour: A simpler proof and a generalization of the zero-trees theorem. Jour. Combinatorial Theory, Ser. A 58 (1991), 301–305. DOI 10.1016/0097-3165(91)90063-M | MR 1129119

[17] L. Schrijver, P. D. Seymour: Spanning trees of different weights, in “Polyhedral Combinatorics”. DIMACS Series. Discrete Math. and Theoret. Comp. Sc. 1 (1990), (eds. W. Cook and P. D. Seymour) 281–288, AMS-ACM Publisher. MR 1105131

[18] D. Steinberg: Computational Matrix Algebra. McGraw-Hill Book Company, 1974. Zbl 0298.65023