The Erdős unit distance problem for small point sets

Boris Alexeev, Dustin G. Mixon, Hans Parshall

We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in \{16,\dots ,30\}$. When $n\le 21$, our bounds match the best kn…