Skip to content

Erdős Problem #132

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: 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

Choose \(n\) distinct planar points. For each positive distance \(d\) occurring between pairs of the points, let \(m(d)\) count its multiplicity among unordered pairs. Call a distance low-multiplicity when

\[ 1\le m(d)\le n. \]

Erdős and Pach asked whether there must always be at least two such distances, and whether the number of low-multiplicity distances necessarily grows without bound as \(n\) tends to infinity. These are different strengths of the same question.

A small example

For four points forming the union of two equilateral triangles glued along one common side, there is a configuration with only one distance whose multiplicity is at most four. Thus the first question cannot hold without an exceptional small-size restriction. The source conjecture asks about all sufficiently large \(n\), and its finite exceptions must not be silently ignored.

The diameter is the largest distance between any two points. Hopf and Pannwitz proved that the diameter can occur at most \(n\) times, giving at least one low-multiplicity distance universally. Their theorem does not guarantee a second.

What is known

The original universal two-distance assertion remains OPEN for general planar sets. Erdős and Fishburn (1995) proved it for \(n=5,6\). More recently, Friedrich Clemen, Adrian Dumitrescu and Ding Liu, On multiplicities of interpoint distances, Acta Mathematica Hungarica 177 (2025), 231–245, prove that a second low-multiplicity distance always exists when the points are in convex position or satisfy an explicit weaker “not too convex” condition. The primary publisher abstract directly confirms the two restricted cases.

That theorem is not a general solution, nor does it settle the stronger divergence of the number of such distances. The same paper gives examples with highly uneven distance multiplicities, illustrating why arguments from a handful of popular distances alone may fail.

GCL's current state

The pinned and maintained #132 keep the universal question OPEN. Its original source issue is #1401. The 2025 primary result and exact restriction to convex or “not too convex” point sets have been checked at publisher-abstract level; the detailed geometric proof was not independently reconstructed.

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 fixture should enumerate squared distances for rational point sets of sizes four to eight, grouping unordered pairs by exact squared lengths. Acceptance: the diameter class has multiplicity at most \(n\), the program reports the number of distance classes with multiplicities between one and \(n\), and a separately constructed four-point example demonstrates why no stronger unconditional four-point assertion is valid. Stop before generalizing a finite pattern or a restricted convex theorem to every planar set.

Sources and claim boundaries

No proof of universal two-distance existence or unbounded low-multiplicity classes, independent proof replay, or editorial admission is claimed.

Catalogue and evidence provenance

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

Back to catalogue · Compendium introduction