Problem 97

Erdős Problem #97 [status: falsifiable; formalized: yes]. Does every convex polygon have a vertex with no other $4$ vertices equidistant from it? Current best: Indeed, if this problem holds for $k+1$ vertices then, by induction, this implies an upper bound of $kn$ for [96]. Prize: $100. Tags: convex, distances, geometry.