Publications of (and about) Paul Erdös
Autor: Erdös, Paul; Fishburn, Peter
Title: A postscript on distances in convex n-gons. (In English)
Source: Discrete Comput. Geom. 11, No.1, 111-117 (1994).
Review: 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.
Reviewer: S.S.Kutateladze (Novosibirsk)
Classif.: * 52A37 Other problems of combinatorial convexity
Keywords: distance; convex polygon
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag