paper

General penny graphs are at most 43/18-dense

arXiv:2402.09131 · doi:10.2140/cnt.2025.14.75

Abstract

We prove that among points in the plane in general position, the shortest distance occurs at most times, improving upon the upper bound of obtained by Tóth in 1997.

arXiv comment13 pages, 21 figures; a few modifications based on the reviews

References in corpus (3)