Unit distances between vertices of a convex polygon
The authors construct convex \(n\)-gons with the property: Their vertices are partitioned into sets \(A\) and \(B\) on opposite sides of a line such that each \(a\in A\) has distance 1 from three vertices in \(B\) and each \(b\in B\) has distance 1 from three vertices in \(A\). The smallest \(n\) for which this is possible is \(n=20\). [Cf. \textit{P. Erdős}, Colloq. Math. Soc. János Bolyai 48, 167-177 (1987; Zbl 0625.52008)].
scientific article; zbMATH DE number 96050