Recent Issues
Volume 14, Issue 2
Volume 14, Issue 1
Volume 13, Issue 4
Volume 13, Issue 3
Volume 13, Issue 2
Volume 13, Issue 1
Volume 12, Issue 4
Volume 12, Issue 3
Volume 12, Issue 2
Volume 12, Issue 1
Volume 11, Issue 4
Volume 11, Issue 3
Volume 11, Issue 2
Volume 11, Issue 1
Volume 10, Issue 4
Volume 10, Issue 3
Volume 10, Issue 2
Volume 10, Issue 1
Volume 9, Issue 4
Volume 9, Issue 3
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 4
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
Older Issues
Volume 7, Issue 4
Volume 7, Issue 3
Volume 7, Issue 2
Volume 7, Issue 1
Volume 6, Issue 4
Volume 6, Issue 2-3
Volume 6, Issue 1
Volume 5, Issue 4
Volume 5, Issue 3
Volume 5, Issue 1-2
Volume 4, Issue 4
Volume 4, Issue 3
Volume 4, Issue 2
Volume 4, Issue 1
Volume 3, Issue 3-4
Volume 3, Issue 2
Volume 3, Issue 1
Volume 2, Issue 4
Volume 2, Issue 3
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 4
Volume 1, Issue 3
Volume 1, Issue 2
Volume 1, Issue 1
Abstract
We prove that among
n
points in the plane in general position, the shortest distance occurs at most
4 3
1 8 n times, improving upon
the upper bound of
1 7
7
n
obtained by G. Tóth in 1997.
Keywords
planar graph, minimum distance, penny graph, general
position, edge density
Mathematical Subject Classification
Primary: 52C10
Secondary: 05C10, 52C15
Milestones
Received: 15 February 2024
Revised: 3 November 2024
Accepted: 17 November 2024
Published: 17 January 2025
© 2025 MSP (Mathematical Sciences
Publishers).