Erdős Problem #92
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (not automatically the live result).
Subject areas: geometry, distances.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Given a finite set \(A\) of \(n\) distinct points in the Euclidean plane, each point \(x\) may have many other points at the same distance from it. That distance may depend on \(x\).
Define \(f(n)\) as the largest integer for which there is an \(n\) point configuration where every point \(x\) has at least \(f(n)\) neighbours on some circle centered at \(x\). Erdős #92 conjectured
The stronger formulation asked for an exponent of order \(1/\log\log n\). This is not an ordinary unit-distance count: the permitted radii can vary with the point.
A small example
For the four vertices of a unit square, each vertex has two neighbours at distance one and one at distance \(\sqrt2\). Thus this particular configuration gives \(f(4)\ge2\). A complete classification of all four-point configurations is not necessary for that lower bound.
The local requirement that every vertex have many equidistant neighbours is stronger than merely having many such pairs on average, unless one passes to a dense subconfiguration.
What is known
DISPROVED. The May 2026 construction disproving the planar unit-distance conjecture in Erdős #90 implies this result. The original OpenAI publication links a mathematical proof of planar point sets with at least \(n^{1+\delta}\) unit-distance pairs for infinitely many \(n\) and some absolute \(\delta>0\).
Here is the exact elementary reduction. On such a point set, make the unit-distance graph \(G\); its average degree is at least \(2n^\delta\). Every graph with average degree \(d\) contains a nonempty subgraph with minimum degree at least \(d/2\): repeatedly delete any vertex whose degree is below \(d/2\), and note that deleting them all would remove fewer than the total \(dn/2\) original edges. Therefore a subset \(A'\) of at most \(n\) points has minimum unit-distance degree at least \(n^\delta\). With \(m=|A'|\), we obtain \(f(m)\ge n^\delta\ge m^\delta\). These \(m\) tend to infinity, so this contradicts a universal subpolynomial upper bound.
Unlike #90, the source for #92 does not require a different radius at every vertex; the counterexample uses the same unit radius throughout.
GCL's current state
The pinned catalogue records DISPROVED (May 2026), as does maintained Erdős #92, edited 21 May 2026. The original source assignment is #1361. The degree-pruning reduction above is checked independently. The deep algebraic-number-theoretic input from #90 has not been re-proved by GCL, nor has its third-party Lean formalization been kernel audited.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
A bounded task is to formalize the graph-pruning lemma and the quantifier transfer from infinitely many original sizes \(n\) to unbounded subconfiguration sizes \(m\), including the inequality \(n^\delta\ge m^\delta\). Acceptance: precise integer rounding, positive minimum-degree bound and a proof that \(m\to\infty\) along some sequence. Stop short of certifying the underlying #90 unit-distance construction.
Sources and claim boundaries
- Original May 2026 unit-distance disproof and accompanying remarks.
- Maintained Erdős #92, status and relationship to #90.
- GCL original issue #1361.
The elementary implication is source-grounded; no independent GCL proof of the main unit-distance construction or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1361 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.