Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Let be Lebesgue measurable with no two points at distance one. Then its upper density satisfies . Hence
so , which answers the site's question in Problem 232 affirmatively and proves Erdős's conjecture [Er85]. The bound applies to the upper density as the problem defines it, over balls centered at the origin, for every measurable set.
What remains. The problem also asks to estimate . With the lower bound from Croft's construction, as the site records, the value lies in , and its exact value is unknown. The claim settles the inequality Erdős asked for and not the exact value.
The argument. The paper's Theorem 1 bounds the upper density of every Lebesgue measurable planar set avoiding unit distances by , and the authors describe the result as an improvement of the earlier upper estimates for Moser's density problem, from which Erdős's conjecture follows. The conjecture is the strict inequality: the paper quotes Erdős's 1985 survey [Er85] (Problems and results in combinatorial geometry, Ann. New York Acad. Sci. 440 (1985), 1–11) as saying that is very likely less than , and its abstract states the result as proving that conjecture. The site's question asks for , which the bound also gives.
Acceptance. The paper is refereed: G. Ambrus, A. Csiszárik, M. Matolcsi, D. Varga and P. Zsámboki, The density of planar sets avoiding unit distances, Mathematical Programming 207 (2024), no. 1–2, 303–327, published online 2023-10-06; the preprint is arXiv:2207.14179, posted 2022-07-28. The curator of erdosproblems.com, Thomas Bloom, marks the problem proved and credits the result to this paper.