Erdős Problem #756 — Rich Distances in Planar Point Sets
For a finite set , let be the set of distances between distinct points of , and for define its multiplicity by
For each positive integer , let
where the maximum is over all -point subsets of the plane. Is there a constant and an integer such that for every ? Equivalently, can an -point planar set determine at least distinct distances, each occurring for more than unordered pairs, for some constant and all sufficiently large ? Erdős Problems #756 Bhowmick, A problem of Erdős about rich distances
Background
Erdős posed the question in 1997. An earlier, stronger question of Erdős and Pach asked whether all distances other than the largest could occur more than times. The largest distance cannot do so: Hopf and Pannowitz proved that it occurs at most times. The related question of whether a second-largest distance must occur more than times is distinct from the linear-count question formulated here. Erdős Problems #756 Bhowmick, A problem of Erdős about rich distances
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.