Status
On this page
Status
Topics
Status
On this page
Status
Topics
Let be minimal such that, in any set of points in , there exist at most pairs of points which distance apart. Estimate .
Source: erdosproblems.com/1085
No claim settles this problem.
Open, in the site's label (OPEN; page last edited 23 May 2026).
The site's remarks call and the most difficult cases and credit
the results that determine in dimension four and above. The
problem's parts, listed in the frontmatter, are plane (), space
(), even_dimensions (even ) and odd_dimensions (odd
); the claim pages in claims/ record the literature for as
partial claims settling the last two parts, and OpenAI's planar power
saving as an accepted partial claim that settles no part. The plane and
space are open, so the standing in the frontmatter, derived from the claim
pages, is open.