Download this article
Download this article For screen
For printing
Recent Issues
Volume 15, Issue 2
Volume 15, Issue 1
Volume 14, Issue 3-4
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
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
founded and published with the
scientific support and advice of
mathematicians from the
Moscow Institute of
Physics and Technology
Subscriptions
 
ISSN 2996-220X (online)
ISSN 2996-2196 (print)
Author Index
To Appear
 
Other MSP Journals
This article is available for purchase or by subscription. See below.
General penny graphs are at most $\frac{43}{18}$-dense

Arsenii Sagdeev
Vol. 14 (2025), No. 1, 75–89
DOI: 10.2140/cnt.2025.14.75
Abstract

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

PDF Access Denied

We have not been able to recognize your IP address 216.73.216.46 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recom­mendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 40.00:

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
Authors
Arsenii Sagdeev
Alfréd Rényi Institute of Mathematics
Budapest
Hungary
© 2025 MSP (Mathematical Sciences Publishers).