ClaimmathematicalA proposition of mathematics: true or false by proof rather than by observation. Settled by a proof others can check, and most firmly by one a machine has checked.constitution →importance · minorImportance 0.30, from 0 to 1 · minor: narrow or largely settled, cheap to get right. Higher-importance claims are worth more to assess, so funding reaches them sooner.constitution →

TopicsDiscrete geometry Repeated distances problem

There exist n-point planar sets where every subset has a distance repeated at least c|A|^2/n^(1-delta) times.

Not yet assessed. Attention goes where its expected value is highest and someone funds it; nothing has funded an assessment of this claim yet, and anyone can.

Decomposition

This claim has not been assessed yet. Attention goes where its expected value is highest and someone funds it; once this claim's assessment is funded and runs, it may well decompose into subclaims.

or create a grant for this whole area →

Provenance

Where this claim has been said, linked to its canonical form.

1 source · no origin · 1 untraced

1 Untraced

Erdős Unit Distance Problem Untraced · nothing upstream recorded

For every positive integer n, they constructed a set P of n points such that every subset A subset= P with at least two points has some distance occurring at least c|A|^2/n^(1-delta) times, for absolute constants c,delta>0.

Erdős Unit Distance Problemextraction 0.90

Lee et al. (2026) robust version of the counterexample phenomenon.

Cite this claim: a formal citation with its evidence attached

Embed this claim: show it on another site with its current assessment

An embed reports the graph's judgment as it stands when the page is viewed: the status with its confidence, how disputed the claim is, and the date. It links back here.

CardFits its column and sizes itself. Without the script it stays a quotation with its link.

<blockquote class="minerval-claim" data-claim-id="e8fef80b-b601-49b3-8000-f51d0f8efe95"><a href="https://minerval.ai/claims/e8fef80b-b601-49b3-8000-f51d0f8efe95">There exist n-point planar sets where every subset has a distance repeated at least c|A|^2/n^(1-delta) times.</a></blockquote>
<script async src="https://minerval.ai/embed.js"></script>

IframeWhere scripts are not allowed. A fixed height; add ?theme=light or ?theme=dark to fix its colours.

<iframe src="https://minerval.ai/embed/claims/e8fef80b-b601-49b3-8000-f51d0f8efe95" title="Minerval: There exist n-point planar sets where every subset has a distance repeated at least c|A|^…" width="480" height="200" style="border:0;max-width:100%" loading="lazy"></iframe>

BadgeAn image for a README or a forum post, in Markdown.

[![Minerval's judgment of this claim](https://minerval.ai/embed/claims/e8fef80b-b601-49b3-8000-f51d0f8efe95/badge.svg)](https://minerval.ai/claims/e8fef80b-b601-49b3-8000-f51d0f8efe95)

The badge now:

Contribute

Every judgment on this page is open to challenge. A contribution is evaluated on its merits by the reviewer; if it succeeds the page changes, and if it does not, the reasons are stated. Either way the exchange becomes part of the claim’s public record.

Created by extractor · Sep 14, 2026. Every judgment on this page is accompanied by a reasoning trace.