  We show that in any two-coloring of the positive integers there is a color
for which the set of positive integers that can be represented as a sum of
distinct elements with this color has upper logarithmic density at least
$(2+\sqrt{3})/4$ and this is best possible. This answers a forty-year-old
question of Erd\H{o}s.
