Erdős Problem #103
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (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
Put \(n\) distinct points in the plane subject to a minimum separation of one: every two points must be at distance at least one. Among all such configurations, minimize the diameter, the largest distance between any pair.
Let \(h(n)\) count how many optimal configurations there are, up to congruence (translation, rotation and reflection). Erdős #103 asks whether
This is about the number of geometrically different optimal packings, not the growth of the optimal diameter itself. Uniform rescaling is not part of congruence because the minimum separation has been fixed at one.
A small example
For two points, the minimum possible diameter is one, attained by a unit segment. Every optimal pair is congruent to every other: \(h(2)=1\).
For three points, every pairwise distance is at least one. The smallest possible diameter is one, realized by an equilateral triangle of side one. If a three-point configuration attains diameter one, each of its three distances must equal one, so it too is congruent to that equilateral triangle. Therefore \(h(3)=1\).
A unit square provides a valid four-point configuration with diameter \(\sqrt2\), but exhibiting a feasible square does not establish that it minimizes diameter among all admissible four-point configurations. Even exact optimal diameter for a particular \(n\) would not by itself count all inequivalent minimizers.
What is known
This conjecture remains OPEN. The maintained Erdős #103 states that it is not even known whether \(h(n)\ge2\) for all sufficiently large \(n\). The related finite diameter-minimization problem is #99, previously accepted outside this cohort, but that numerical problem is not equivalent to the count of distinct equality cases.
Historical primary source: Erdős, Some problems on elementary geometry, [Er94b], listed in the maintained bibliography. The original printed page and later small-size classification literature have not been independently inspected for this particular source audit. A secondary challenge record dated July 2026 is a task statement, not evidence of a proof or counterexample.
GCL's current state
The pinned catalogue and maintained page both classify #103 OPEN. Original authenticated source issue: #1372. The \(n=2\) and \(n=3\) optimality and uniqueness arguments above are elementary and independently verified. No published theorem about eventual multiplicity or eventual uniqueness is asserted.
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 successor is to formalize existence, optimality and congruence for the two- and three-point cases. Acceptance: prove that minimum separation at least one forces diameter at least one, that the unit segment and equilateral unit triangle attain the infimum, and that any diameter-one configuration with the corresponding number of points is congruent to the example. An extension to \(n=4\) would require an exhaustive geometric optimality certificate, not merely numerical optimization. Stop before making any asymptotic inference.
Sources and claim boundaries
- Erdős #103, original [Er94b] attribution and distinction from #99.
- GCL original source issue #1372; pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89.
No new infinite-family result, machine-certified optimal-packing classification or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1372 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: FORMAL_SOURCE_REFRESH_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.