A five color zero-sum generalization

DOI10.1007/s00373-005-0636-xzbMath1111.05095OpenAlexW1972363653MaRDI QIDQ855293

Andrew Schultz, David J. Grynkiewicz

Publication date: 5 January 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-005-0636-x

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Ramsey theory (05D10)

Related Items (3)

Representing Sequence Subsums as Sumsets of Near Equal Sized Sets ⋮ On a zero-sum generalization of a variation of Schur's equation ⋮ On three sets with nondecreasing diameter

Cites Work

• Unnamed Item
• On a modification of a problem of Bialostocki, Erdős, and Lefmann
• On a zero-sum generalization of a variation of Schur's equation
• A simpler proof and a generalization of the zero-trees theorem
• An addition theorem for finite abelian groups
• Monochromatic and zero-sum sets of nondecreasing diameter
• On four color monochromatic sets with nondecreasing diameter
• On four colored sets with nondecreasing diameter and the Erdős-Ginzburg-Ziv theorem
• A zero-sum theorem
• Zero-sum problems -- a survey
• On a partition analog of the Cauchy-Davenport Theorem
• On zero-trees
• On zero sum Ramsey numbers: Multiple copies of a graph

This page was built for publication: A five color zero-sum generalization