Zentralblatt MATH
Publications of (and about) Paul Erdös
Zbl.No: 666.10036
Autor: Erdös, Paul; Spencer, Joel
Title: Monochromatic sumsets. (In English)
Source: J. Comb. Theory, Ser. A 50, No.1, 162-163 (1989).
Review: The sumset P(S) is defined to be the set of all finite sums of distinct elements in S\subset N. The number F(k) is defined to be the least n such that if { 1,...,n} is two coloured then there is a k-set S with P(S)\subset {1,...,n} and P(S) monochromatic. A short proof that F(k) > 2ck2/ log k is given, and a conjecture related to removing the logarithmic term is posed.
Reviewer: M.Dodson
Classif.: * 11B13 Additive bases
05A05 Combinatorial choice problems
11B75 Combinatorial number theory
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag