The maximum number of second smallest distances in finite planar sets
Using linear optimization the author gives a bound on the maximum number of second smallest distances in an \(n\)-element point set. In the given bound the constant is best possible. Also a theorem which gives some structural information on the extremal sets is given.
scientific article; zbMATH DE number 54915