Erdős Problem #1084 — Let f_d(n) be minimal such that in any collection of n points in R^d, all of distance at least 1 apart, there are at most f_d(n) many pairs of points which are distance 1 apart.

Question

Let f_d(n) be minimal such that in any collection of n points in R^d, all of distance at least 1 apart, there are at most f_d(n) many pairs of points which are distance 1 apart. Estimate f_d(n).

Erdős Problem #1084 — Let $f_d(n)$ be minimal such that in any collection of $n$ points in $\mathbb{R}^d$ , all of distance at least $1$ apart, there are at most $f_d(n)$ many pairs of points which are distance $1$ apart.

Primary source

Additional references

Progress summary

Solutions 0