An improved constant factor for the unit distance problem

DOI10.1556/012.2022.01517MaRDI QIDQ6342613arXivFDO

Authors Péter Ágoston, Dömötör Pálvölgyi

Publication date 11 June 2020

Published in arXiv

Full work available at URL https://doi.org/10.1556/012.2022.01517

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

arXiv classification

cs.DMmath.CO

Abstract: We prove that the number of unit distances among $n$ planar points is at most $1.94cdot{n}^{4/3}$, improving on the previous best bound of $8n^{4/3}$. We also give better upper and lower bounds for several small values of $n$. We also prove some variants of the crossing lemma and improve some constant factors.

This page was built for publication: An improved constant factor for the unit distance problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6342613)