The Erdos-Moser sum-free set problem
Classical Analysis and ODEs
2019-11-07 v3 Combinatorics
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.
Keywords
Cite
@article{arxiv.1804.03356,
title = {The Erdos-Moser sum-free set problem},
author = {Tom Sanders},
journal= {arXiv preprint arXiv:1804.03356},
year = {2019}
}
Comments
47 pages. Corrections and clarifications