Unit distances between vertices of a convex polygon
type: Item
instance of: scholarly article
title: Unit distances between vertices of a convex polygon
zbMATH Open document ID: 0760.52007
DOI: 10.1016/0925-7721(92)90026-O
author: Peter Fishburn
author: James A. Reeds
published in: Computational Geometry
publication date: 1993-01-17T00:00:00Z
review text: The authors construct convex \(n\)-gons with the property: Their vertices are partitioned into sets \(A\) and \(B\) on opposite sides of a line such that each \(a\in A\) has distance 1 from three vertices in \(B\) and each \(b\in B\) has distance 1 from three vertices in \(A\). The smallest \(n\) for which this is possible is \(n=20\). [Cf. \textit{P. Erdős}, Colloq. Math. Soc. János Bolyai 48, 167-177 (1987; Zbl 0625.52008)].
Mathematics Subject Classification ID: 52A37
zbMATH DE Number: 96050
zbMATH Keywords: convex \(n\)-gons
reviewed by: Ernest Jucovič
MaRDI profile type: MaRDI publication profile
cites work: A lower bound on the number of unit distances between the vertices of a convex polygon
cites work: Q3027796
cites work: The maximum number of unit distances in a convex \(n\)-gon
full work available at URL: 0925-7721(92)90026-o
OpenAlex ID: W2004962410
Recommended article: A lower bound on the number of unit distances between the vertices of a convex polygon
Recommended article: Q4873151
Recommended article: Small distances in convex polygons
Recommended article: Intervertex distances in convex polygons
Recommended article: Convex polygons with few intervertex distances
description: scientific article; zbMATH DE number 96050