A Two-Set Problem on Coloring the Integers

DOI10.1137/S0895480103429320MaRDI QIDQ3519206zbMATH OpenFDO

Authors Jeffrey A. Ryan

Publication date 13 August 2008

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480103429320

zbMATH Keywords

combinatoricsnumber theoryRamsey theorysequences mod \(m\)

Mathematics Subject Classification ID

Ramsey theory (05D10) Sequences (mod (m)) (11B50)

Recommendations

• A five color zero-sum generalization
• Monochromatic and zero-sum sets of nondecreasing diameter
• On constrained 2-partitions of monochromatic sets and generalizations in the sense of Erdős-Ginzburg-Ziv.
• On monochromatic sets of integers whose diameters form a monotone sequence
• A zero-sum theorem

Cited in

(7)

• Monochromatic and zero-sum sets of nondecreasing diameter
• Two remarks on the coloring number
• A zero-sum theorem
• Sure monochromatic subset sums
• On constrained 2-partitions of monochromatic sets and generalizations in the sense of Erdős-Ginzburg-Ziv.
• Monochromatic and zero-sum sets of nondecreasing modified diameter
• A five color zero-sum generalization

This page was built for publication: A Two-Set Problem on Coloring the Integers

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