All Questions

There are $n$ points on the plane, and we need to maximize the number of pairs of points which have the same Euclidean distance.

Koebe–Andreev–Thurston theorem (known also as the circle packing theorem) says that any planar graph can be realized by a set of (interior-) disjoint disks corresponding to vertices, such that two ...