Erdős Problem 103: diameter minimising incongruent sets

### What is the conjecture

https://www.erdosproblems.com/103

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$?

Status: open

### Prerequisites needed
`Congruent` exists, and we should have `diameter` soon, see #330.

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else