Uniqueness of maximum planar five-distance sets (Q924997)

A set of points in the plane is called \(k\)-distance if there are exactly \(k\) different distances between two distinct points in the set. Two subsets are considered the same if they are related by an isometry and/or a similarity transformation. Let \(g(k)\) denote the maximum possible size of a \(k\)-distance set. It is known that \(g(k)=5,7,9,12\) for \(k=2,3,4,5\) respectively. Moreover, the 5-point 2-distance set is unique, there are exactly two 7-point 3-distance sets, and exactly four 9-point 4-distance sets. It was conjectured that the known 12-point 5-distance set is unique. In this paper the author proves that the 12-point 5-distance set is indeed unique. All 8-point 4-distance sets are shown, these include vertex deleted subgraphs of the 9-point 4-distance graphs and three sporadic examples. Diameter graphs of a planar set are introduced, these have vertex set the points in the given set with two vertices adjacent if and only if their distance is the diameter of the set. These graphs are studied and characterized.