{
  "id": "1804.03356",
  "version": "v2",
  "published": "2018-04-10T06:26:13.000Z",
  "updated": "2018-05-20T06:19:39.000Z",
  "title": "The Erdos-Moser sum-free set problem",
  "authors": [
    "Tom Sanders"
  ],
  "comment": "43 pages. Expanded discussion in section 2. Fixed some typos",
  "categories": [
    "math.CA",
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2018-05-20T06:19:39.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "erdos-moser sum-free set problem",
      "finite set",
      "distinct elements"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 43,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}