A postscript on distances in convex \(n\)-gons
type: Item
instance of: scholarly article
title: A postscript on distances in convex \(n\)-gons
zbMATH Open document ID: 0815.52006
DOI: 10.1007/BF02573998
author: Peter Fishburn
author: P. Erdős
published in: Discrete \& Computational Geometry
publication date: 1994-02-16T00:00:00Z
full work available at URL: https://eudml.org/doc/131292
review text: Denote by \(g(n)\) the largest \(k\) such that every convex polygon with \(n\) vertices has a vertex \(x\) for which the next \(k\) vertices clockwise from \(x\) or the next \(k\) vertices counterclockwise from \(x\) are successively farther from \(x\). The authors prove that \(g(n) = [n/3] + 1\) for \(n \geq 4\).
Mathematics Subject Classification ID: 52A37
zbMATH DE Number: 502911
zbMATH Keywords: distance
zbMATH Keywords: convex polygon
Wikidata QID: Q94701100
reviewed by: S. S. Kutateladze
MaRDI profile type: Publication
cites work: On A Problem of P. Erdos
cites work: On Sets of Distances of n Points
cites work: Multiplicities of interpoint distances in finite planar sets
cites work: On the Different Distances Determined by n Points
OpenAlex ID: W2041472993
DBLP publication ID: journals/dcg/ErdosF94
Recommended article: On unit distances in a convex polygon
Recommended article: Q4504217
Recommended article: Q4549037
Recommended article: The maximum number of unit distances in a convex \(n\)-gon
Recommended article: On distinct distances from a vertex of a convex polygon
Recommended article: Q4873151
Recommended article: Q5689016
Recommended article: A lower bound on the number of unit distances between the vertices of a convex polygon
description: scientific article; zbMATH DE number 502911