Erdős Problem #789

declared status 'open'. Formalized: yes. Let $h(n)$ be maximal such that if $A\subseteq \mathbb{Z}$ with $\lvert A\rvert=n$ then there is $B\subseteq A$ with $\lvert B\rvert \geq h(n)$ such that if $a_1+\cdots+a_r=b_1+\cdots+b_s$ with $a_i,b_i\in B$ then $r=s$. Estimate $h(n)$. Prize: no. Tags: additive combinatorics.

Notation is rendered from the stored source. The pinned checkout remains the exact record.