Erdős sumset conjecture

In additive combinatorics, the Erdős sumset conjecture is a conjecture which states that if a subset ${\displaystyle A}$ of the natural numbers ${\displaystyle \mathbb {N} }$ has a positive upper density then there are two infinite subsets ${\displaystyle B}$ and ${\displaystyle C}$ of ${\displaystyle \mathbb {N} }$ such that ${\displaystyle A}$ contains the sumset ${\displaystyle B+C}$.^[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]

See also

• List of conjectures by Paul Erdős

Notes

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e

This page was last edited on 5 March 2024, at 22:23