A new proof of Vazsonyi's conjecture

Simple item page
dc.creatorSwanepoel, Konrad J
dc.date2007-05-04
dc.date.accessioned2026-07-07T09:38:06Z
dc.date.available2026-07-07T09:38:06Z
dc.descriptionWe 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.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/0705.0606
dc.identifierhttp://arxiv.org/abs/0705.0606
dc.identifierJournal of Combinatorial Theory, Ser. A 115 (2008) 888-892.
dc.identifierdoi:10.1016/j.jcta.2007.08.006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160690
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subject52C10 (Primary). 05C10 (Secondary)
dc.titleA new proof of Vazsonyi's conjecture
dc.typetext

Files

Collections

arXiv