Erdős Problem #97 — Equidistant Points in Convex Polygons
For a finite set , say that is in convex position if every point of is a vertex of its convex hull. For , define the largest number of other points of on any circle centered at by
The maximum exists because is finite. Is it true that every nonempty finite set in convex position has a point such that
Equivalently, must every convex polygon have a vertex for which no four other vertices are all at the same distance from it? The restriction excludes the center itself. Erdős Problems #97
Background
Erdős first proposed the analogous assertion with three other vertices instead of four. Danzer disproved that version by constructing a convex 9-gon in which every vertex has three other vertices at a common distance from it; the distance is allowed to depend on the vertex. The episode also prompted a clarification of an incorrectly attributed stronger result: Erdős and Purdy recorded Danzer's correction that his construction established the three-point case, not the claimed result for arbitrary numbers of equidistant vertices. Erdős Problems #97 Erdős and Purdy, Some Extremal Problems in Geometry IV
Erdős restated the four-point conjecture in 1986. The key distinction between the known counterexamples to the three-point version and the question here is the threshold: having three equidistant neighbors at each vertex does not by itself provide four. Erdős, On Some Metric and Combinatorial Geometric Problems (1986)
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.