Erdős sumset conjecture
Statement
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 . It was posed by Paul Erdős, and was proven in 2019 in a paper by Joel Moreira, Florian Richter and Donald Robertson.
Further reading
- Wikipedia, page 64308146, revision 1212046137, Erdős sumset conjecture. adopted
About this page
| Tag | D5WSHR29WE |
|---|---|
| URI | m2://D5WSHR29WE |
| Kind | statement, proposition |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status D5WSHR29WE. |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- edge uses out: each definition that the statement needs (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.