Last year I wrote a post about a distinct distances problem that involves local properties of the point set. Specifically, let denote the minimum number of distinct distances that can be determined by a set of points, such that any points of determine at least distinct distances. That is, by assuming that the point set satisfies a local property, we wish to conclude the global property of many distinct distances. For more details and examples, see the original post.

A while ago I noticed another nice bound for this set of problems. Unfortunately the proof is very simple, which prevents it from being published in a “decent” journal. I’ve been trying to push it further, so far without success. Perhaps someone else would see how this idea can be extended.

As discussed in the previous post, Fox, Pach, and Suk proved that for every and , we have

A simple argument shows that for every we have

Our interest in this post lies in between these two bounds. That is, what happens between the values and . I am only aware of one previous result in thie range: Erdős and Gyárfás showed that . We will now prove a stronger result.

**Theorem 1.**

*For every that is divisible by four, we have*