General penny graphs are at most 43/18-dense
<|reference_start|>General penny graphs are at most 43/18-dense: 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.<|reference_end|>
@article{sagdeev2024general,
    title={General penny graphs are at most 43/18-dense},
    author={Arsenii Sagdeev},
    journal={arXiv preprint arXiv:2402.09131},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.09131},
    primaryClass={math.CO cs.CG math.MG}
}