Back to Search
Start Over
The Erdos-Moser sum-free set problem
- Source :
- Canad. J. Math. 2019
- Publication Year :
- 2018
-
Abstract
- We show that if A is a finite set of integers then it has a subset S of size \log^{1+c} |A| (c>0 absolute) such that s+s' is never in A when s and s' are distinct elements of S.<br />Comment: 47 pages. Corrections and clarifications
- Subjects :
- Mathematics - Classical Analysis and ODEs
Mathematics - Combinatorics
Subjects
Details
- Database :
- arXiv
- Journal :
- Canad. J. Math. 2019
- Publication Type :
- Report
- Accession number :
- edsarx.1804.03356
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.4153/S0008414X1900049X