A five color zero-sum generalization

DOI10.1007/S00373-005-0636-XMaRDI QIDQ855293zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Zero-sum generalized Schur numbers
• A Two-Set Problem on Coloring the Integers
• A zero-sum theorem
• Two-color zero-sum Rado numbers
• The determination of 2-color zero-sum generalized Schur numbers

Cites work

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

Cited in

(6)

• On a zero-sum generalization of a variation of Schur's equation
• A Two-Set Problem on Coloring the Integers
• A zero-sum theorem
• Zero-sum generalized Schur numbers
• Representing sequence subsums as sumsets of near equal sized sets
• On three sets with nondecreasing diameter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855293)