Problem 103

Erdős Problem #103: declared status 'open'. Formalized: no. Let $h(n)$ count the number of incongruent sets of $n$ points in $\mathbb{R}^2$ which minimise the diameter subject to the constraint that $d(x,y)\geq 1$ for all points $x\neq y$. Is it true that $h(n)\to \infty$? Prize: no. Tags: distances, geometry.