Intervertex distances in convex polygons

DOI10.1016/0166-218X(94)00047-HzbMath0831.52009OpenAlexW2061819340WikidataQ59701084 ScholiaQ59701084MaRDI QIDQ1894358

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)00047-h

zbMATH Keywords

minimum number of different distancesmultiplicity vector

Mathematics Subject Classification ID

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

Related Items (3)

Distinct distances in finite planar sets ⋮ Obituary: Peter C. Fishburn (1936--2021) ⋮ The chords' problem

Cites Work

• Unnamed Item
• A lower bound on the number of unit distances between the vertices of a convex polygon
• Unit distances between vertices of a convex polygon
• A postscript on distances in convex \(n\)-gons
• The maximum number of unit distances in a convex \(n\)-gon
• Multiplicities of interpoint distances in finite planar sets
• Convex polygons with few intervertex distances
• On A Problem of P. Erdos
• On the Different Distances Determined by n Points
• On Sets of Distances of n Points

This page was built for publication: Intervertex distances in convex polygons