A lower bound on the number of unit distances between the vertices of a convex polygon
type: Item
instance of: scholarly article
title: A lower bound on the number of unit distances between the vertices of a convex polygon
zbMATH Open document ID: 0760.52001
DOI: 10.1016/0097-3165(91)90042-F
author: Péter Hajnal
author: Herbert Edelsbrunner
published in: Journal of Combinatorial Theory. Series A
publication date: 1992-06-25T00:00:00Z
review text: The authors prove that to every \(n\geq 4\) there exists a convex \(n\)-gon such that at least \(2n-7\) of its vertex pairs are of unit mutual distance. This improves for \(n\geq 17\) a result by P. Erdős and L. Moser.
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 8162
zbMATH Keywords: number of unit distances
zbMATH Keywords: vertices
zbMATH Keywords: convex polygon
reviewed by: Ernest Jucovič
MaRDI profile type: MaRDI publication profile
cites work: On Sets of Distances of n Points
cites work: Q3864528
cites work: Q5186278
full work available at URL: 0097-3165(91)90042-f
OpenAlex ID: W1998206124
Recommended article: On unit distances in a convex polygon
Recommended article: Unit distances between vertices of a convex polygon
Recommended article: On distinct distances from a vertex of a convex polygon
Recommended article: The unit distance problem for centrally symmetric convex polygons
description: scientific article; zbMATH DE number 8162