An improved constant factor for the unit distance problem

06/11/2020
by   Péter Ágoston, et al.
0

We prove that the number of unit distances among n planar points is at most 1.94· 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. Our main method is a crossing lemma for multigraphs with a better constant, which is of independent interest, as our proof is simpler than earlier proofs.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset