combinatorics / Combinatorial geometry
Erdős asked whether every $n$-point set in Euclidean space whose pairwise distances are mutually at least 1 apart must have diameter at least $(1+o(1))n^2$. Disproved: an explicit high-dimensional construction beats the conjectured constant.
Temporal state
No reconciled state yet.
Append-only history
Erdős asked whether every $n$-point set in Euclidean space whose pairwise distances are mutually at least 1 apart must have diameter at least $(1+o(1))n^2$. Disproved: an explicit high-dimensional construction beats the conjectured constant.
Research memory
Erdős asked whether every $n$-point set in Euclidean space whose pairwise distances are mutually at least 1 apart must have diameter at least $(1+o(1))n^2$. Disproved: an explicit high-dimensional construction beats the conjectured constant.
Evidence graph
No public relationships recorded yet.