Status
On this page
Status
Topics
Status
On this page
Status
Topics
Let be the minimal such that if we two-colour there is a set of size such that all subset sums (for ) are monochromatic. Estimate .
Source: erdosproblems.com/531
No claim settles this problem.
The site labels the problem OPEN. The bounds located in the search, whose scope the Current assessment records, are the doubly exponential lower bound of Balogh, Eberhard, Narayanan, Treglown and Wagner (2017, refereed), which replaced Erdős and Spencer's (1989), and Taylor's tower-type upper bound (1981, Corollary 3.4), at most a tower of threes of height . No source narrows the gap between them. This is a bounded negative finding, not a certificate of openness.