论文信息 - On Four Colored Sets with Nondecreasing Diameter and the Erds-Ginzburg-Ziv Theorem

On Four Colored Sets with Nondecreasing Diameter and the Erds-Ginzburg-Ziv Theorem

A set X, with a coloring Δ: X → Zm, is zero-sum if Σx∈XΔ(x) = 0. Let f(m, r) (let fzs (m, 2r)) be the least N such that for every coloring of 1,..., N with r colors (with elements from r disjoint copies of Zm) there exist monochromatic (zero-sum) m-element subsets B1 and B2, not necessarily the same color, such that (a) max(B1)-min(B1)≤max(B2)-min(B2), and (b) max (B1)

David J. Grynkiewicz | D. Grynkiewicz

[1] Raphael Yuster,et al. The characterization of zero-sum (mod 2) bipartite Ramsey numbers , 1998 .

[2] Rajeev Motwani,et al. Randomized Algorithms: Number Theory and Algebra , 1995 .

[3] Paul Erdös,et al. Monochromatic and zero-sum sets of nondecreasing diameter , 1995, Discret. Math..

[4] Paul Erdös,et al. Quasi-progressions and descending waves , 1990, J. Comb. Theory, Ser. A.

[5] Melvyn B. Nathanson,et al. Additive Number Theory: Inverse Problems and the Geometry of Sumsets , 1996 .

[6] Noga Alon,et al. Ascending waves , 1989, J. Comb. Theory, Ser. A.

[7] M. Kneser,et al. Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen , 1954 .

[8] Yair Caro,et al. Zero-sum problems - A survey , 1996, Discret. Math..

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

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

[11] Weidong Gao,et al. A Combinatorial Problem on Finite Abelian Groups , 1996 .

[12] Roger Crocker,et al. A theorem in additive number theory , 1969 .