/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtilpublicimportFormalConjectures.ErdosProblems.«90»
[AMP25] B. Alexeev, D. Mixon, and H. Parshall, The Erdős unit distance problem for small point
sets. arXiv:2412.11914 (2025).
[EHSVZ25] P. Engel, O. Hammond-Lee, Y. Su, D. Varga, and P. Zsámboki, Diverse beam search to
find densest-known planar unit distance graphs. arXiv:2406.15317 (2025).
[Er97f] Erdős, Paul, Some unsolved problems. Combinatorics, geometry and probability
(Cambridge, 1993) (1997), 1-10.
Is it true that the number of incongruent sets of $n$ points in $\mathbb{R}^2$ which maximise the
number of unit distances tends to infinity as $n\to\infty$?
The actual maximal number of unit distances is the subject of
Erdős Problem 90.
Two sets of points are congruent if an isometry of the plane maps one onto the other.
In fact this is $=1$ also for $n=4$, the unique example given by two equilateral triangles joined
by an edge.
Computational evidence of Engel, Hammond-Lee, Su, Varga, and Zsámboki [EHSVZ25] and Alexeev,
Mixon, and Parshall [AMP25] suggests that this count is $=1$ for various other $5\leq n\leq 21$
(although these calculations were checking only up to graph isomorphism, rather than
congruency).
For $n=4$ there is, up to congruence, exactly one set of points in $\mathbb{R}^2$ which maximises
the number of unit distances: two unit equilateral triangles $abc$ and $bcd$ joined by the edge
$bc$, with $a\neq d$.