English

An Improved Upper Bound for the Sum-free Subset Constant

Combinatorics 2010-07-19 v1

Abstract

We show that the optimal constant in Erd\"{o}s' sum-free subset theorem cannot be larger than 11/28.39311/28 \approx .393.

Cite

@article{arxiv.1007.2685,
  title  = {An Improved Upper Bound for the Sum-free Subset Constant},
  author = {Mark Lewko},
  journal= {arXiv preprint arXiv:1007.2685},
  year   = {2010}
}

Comments

12 pages

R2 v1 2026-06-21T15:48:44.483Z