Conjecture in additive combinations about subsets of natural numbers
In
additive combinatorics, the Erdős sumset conjecture is a conjecture which states that if a subset of the
natural numbers has a positive upper
density then there are two infinite subsets and of such that contains the
sumset.[1][2] It was posed by
Paul Erdős, and was proven in 2019 in a paper by Joel Moreira, Florian Richter and Donald Robertson.[3]