Skip to content

Erdős Problem #223

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: solved (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

Among \(n\) distinct points in \(\mathbb R^d\) with diameter exactly one, how many unordered pairs can be exactly distance one apart? Denote this maximum by \(f_d(n)\). The diameter restriction forbids any distance greater than one, so pairs attaining distance one are diameter pairs.

The answer depends strongly on the dimension. This is not the classic unit-distance problem without a diameter restriction: a configuration with many unit pairs but greater diameter is inadmissible.

A small example

In the plane, the three vertices of an equilateral triangle of side one form three diameter pairs. In \(\mathbb R^3\), the four vertices of a regular tetrahedron of edge length one yield six pairs at the diameter, matching \(2n-2\) when \(n=4\).

For \(n=2\) there is only one unordered pair, so \(f_d(2)=1\), whatever the dimension. Statements such as \(f_2(n)=n\) or \(f_3(n)=2n-2\) require the appropriate qualifications for small \(n\), and cannot be extrapolated to \(n=2\).

What is known

The extremal question is SOLVED. In the plane, Hopf and Pannwitz (1934) proved \(f_2(n)=n\) for \(n\ge3\). In three dimensions, Grünbaum, Heppes and Straszewicz independently established \(f_3(n)=2n-2\) for \(n\ge4\), with small configurations treated separately.

For dimensions \(d\ge4\), Erdős (1960) showed that

\[ f_d(n)=\left(\frac{p-1}{2p}+o(1)\right)n^2, \qquad p=\lfloor d/2\rfloor. \]

This predicts quadratic growth unlike the planar and spatial linear formulas. Swanepoel (2009) supplied exact extremal values and structures for all sufficiently large \(n\) in each fixed dimension \(d\ge4\). “Sufficiently large” depends on \(d\); the asymptotic expression does not determine the values for every small \(n\).

GCL's current state

Pinned and maintained Erdős #223 classify the problem SOLVED. Original issue #1492. The low-dimensional and asymptotic theorems are sourced from the maintained catalogue, but their full extremal-geometry proofs and exact Swanepoel classification were not independently replayed.

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 enumerates unit-diameter configurations for known regular simplices and planar unit-diameter polygons, verifying all pair distances and counts. Acceptance: the tetrahedron yields six pairs, an equilateral triangle yields three, and the \(n=2\) exception is explicit. Any claim about maximality beyond these examples must cite the published theorem rather than numerical sampling.

Sources and claim boundaries

No new extremal bound, independently re-established exact classification or editorial admission is claimed.

Catalogue and evidence provenance

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

Back to catalogue · Compendium introduction