Multiplicities of interpoint distances in finite planar sets

DOI10.1016/0166-218X(94)00046-GzbMath0831.52008OpenAlexW2040107129WikidataQ94701094 ScholiaQ94701094MaRDI QIDQ1894357

Paul Erdős, Peter C. Fishburn

Publication date: 29 January 1996

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00046-g

zbMATH Keywords

minimum number of different distancesmultiplicity vector

Mathematics Subject Classification ID

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

Related Items

Intervertex distances in convex polygons, Convex polygons with few intervertex distances, Distinct distances in finite planar sets, On the chromatic number of subsets of the Euclidean plane, Obituary: Peter C. Fishburn (1936--2021), A postscript on distances in convex \(n\)-gons, The chords' problem

Cites Work

• Unnamed Item
• Unnamed Item
• The grid revisited
• Variations on the theme of repeated distances
• Extremal problems in discrete geometry
• Unit distances
• A lower bound on the number of unit distances between the vertices of a convex polygon
• Unit distances between vertices of a convex polygon
• The maximum number of unit distances in a convex \(n\)-gon
• Multiple Pythagorean Number Triples
• A Problem of Leo Moser About Repeated Distances on the Sphere
• On A Problem of P. Erdos
• Some Theorems on Convex Polygons
• On the Different Distances Determined by n Points
• On Sets of Distances of n Points