Problem 1088

Erdős Problem #1088: declared status 'open'. Formalized: no. Let $f_d(n)$ be the minimal $m$ such that any set of $m$ points in $\mathbb{R}^d$ contains a set of $n$ points such that any two determined distances are distinct. Estimate $f_d(n)$. In particular, is it true that, for fixed $n\geq 3$,$$f_d(n)=2^{o(d)}?$$ Prize: no. Tags: geometry.