A new proof of Vazsonyi's conjecture
arXiv:0705.0606 · doi:10.1016/j.jcta.2007.08.006
Abstract
We present a self-contained proof that the number of diameter pairs among n points in Euclidean 3-space is at most 2n-2. The proof avoids the ball polytopes used in the original proofs by Grunbaum, Heppes and Straszewicz. As a corollary we obtain that any three-dimensional diameter graph can be embedded in the projective plane.
4 pages