General penny graphs are at most 43/18-dense
Abstract
We prove that among n points in the plane in general position, the shortest distance occurs at most 43n/18 times, improving upon the upper bound of 17n/7 obtained by T\'oth in 1997.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.