Skip to content

Erdős Problem #99

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

Arrange \(n\) points in the plane so that distinct points stay at least one unit apart and some pair is exactly one unit apart. Among all such configurations, minimize the diameter (the largest interpoint distance). Erdős #99 asks whether, for all sufficiently large \(n\), every minimizing configuration must contain three points at pairwise distance one: a unit equilateral triangle. The word every matters: one appealing minimizing picture is not enough to establish the conjecture.

A small example

For \(n=3\), the vertices of an equilateral triangle of side one have diameter one, the minimum possible because the required minimum separation is one. They exhibit the desired triangle. For \(n=4\), the vertices of a unit square have diameter \(\sqrt 2\) but no unit equilateral triangle; this small configuration cannot refute an assertion about sufficiently large \(n\).

A useful check comes from the unit-contact graph: join points at distance exactly one. Two unit segments with disjoint endpoints cannot cross, because crossing would put some pair of endpoints closer than one. Thus the graph is planar. If the configuration has no unit triangle, it is triangle-free, giving at most \(2n-4\) unit edges for \(n\ge3\). This elementary necessary restriction does not prove that a diameter-minimizing set has a triangle.

What is known

Bezdek and Fodor, Minimal Diameter of Certain Sets in the Plane, Journal of Combinatorial Theory A 85 (1999), 105–111, study exact small configurations, including \(D(8)\); finite values do not determine eventual minimizers. The dated GCL audit also records a September 2026 author manuscript proposing stress/rigidity reductions; these are author-reported reductions, not GCL-verified proof of #99.

GCL's current state

The audit fixes the quantifiers and the pinned formal-provider statement, proves by elementary compactness that an optimal configuration exists for every \(n\ge2\), and derives the planar contact graph and the degree-at-most-five condition when unit triangles are absent. This is analytical source work, not a Lean kernel replay or a global solution.

What remains

The gap is between local constraints on unit contacts and a global conclusion about all diameter minimizers beyond some threshold. Contact sparsity alone cannot establish that conclusion. Any proposed proof must rule out every triangle-free optimizer for every sufficiently large size.

Sources and claim boundaries

  • Erdős Problems #99 and history: current-question registry and status.
  • Erdős, Some problems in number theory, combinatorics and combinatorial geometry, Mathematica Pannonica 5 (1994), 261–269, bibliography. The original page was not fully rechecked in the GCL source audit.
  • Bezdek–Fodor (1999): finite results for small configurations.
  • GCL source audit #1368: exact semantic and elementary checking, no mathematical certification.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1368 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: FIRST_RECONNAISSANCE_TRANCHE.
  • 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.

Back to catalogue · Compendium introduction