Maximum planar sets that determine \(k\) distances

DOI10.1016/0012-365X(95)00153-NzbMath0868.52007WikidataQ94701091 ScholiaQ94701091MaRDI QIDQ1126289

Paul Erdős, Peter C. Fishburn

Publication date: 21 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal problemspoint configurationsdistances in graphextremal sets of points

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items (18)

Classification of seven-point four-distance sets in the plane ⋮ Distance Sets on Circles ⋮ Unnamed Item ⋮ Sparse distance sets in the triangular lattice ⋮ Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances ⋮ Maximal 2-distance sets containing the regular simplex ⋮ The two-distance sets in dimension four ⋮ Unnamed Item ⋮ Uniqueness of maximum planar five-distance sets ⋮ Complex spherical codes with two inner products ⋮ On 5-isosceles sets in the plane, with linear restriction ⋮ Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\) ⋮ On a generalization of distance sets ⋮ Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) ⋮ Optimal point sets determining few distinct triangles ⋮ Characterizing optimal point sets determining one distinct triangle ⋮ A proof of a dodecahedron conjecture for distance sets ⋮ Lattice Configurations Determining Few Distances

Cites Work

• The number of different distances determined by a set of points in the Euclidean plane
• Convex polygons with few intervertex distances
• Convex nonagons with five intervertex distances
• On A Problem of P. Erdos
• On Sets of Distances of n Points

This page was built for publication: Maximum planar sets that determine \(k\) distances