Erdős Problem #1208
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
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.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1208 currently has source status OPEN SHARP EXTREMAL BOUNDS.
For fixed \(d\ge2\), \(F_d(n)\) is the largest integer guaranteed so that every set of \(n\) points in \(\mathbb R^d\) contains an \(F_d(n)\)‑point subset with all unordered pairwise distances distinct. It is a min–max over configurations, not a maximum for just a lattice. This is stronger than merely avoiding isosceles triangles (#1207), since distances belonging to disjoint pairs must also differ.
A small example
Exhaustively checking all \(512\) subsets of the \(3\times3\) integer grid yields 86 subsets with all pairwise distances distinct, of maximum size three. A witness \(\{(0,0),(0,2),(1,0)\}\) has squared distances \(4,1,5\). This is exact for one nine-point configuration, not the universal value of \(F_2(9)\) or a bound for all \(n\).
What is known
The maintained source https://www.erdosproblems.com/1208 remains OPEN for sharp bounds. In the plane, Charalambides [Ch13] and September 2026 Lee–Pohoata–Zhu [LPZ26] give \(n^{1/3}/(\log n)^{1/3}\ll F_2(n)\ll n^{1/2-c}\) for some \(c>0\). For \(d\ge3\) Conlon–Fox–Gasarch–Harris–Ulrich–Zbarsky [CFGHUZ15] improve Thiele to \(F_d(n)\gg_d n^{1/(3d-3)}(\log n)^{1/3-2/(3d-3)}\); integer lattices show \(F_d(n)\ll n^{1/d}\). LPZ26 original proof not independently verified.
GCL's current state
Authenticated original-issue research return. The finite example was independently replayed with ci/erdos_compendium_007_phase25_checks.py; the source-attributed theorem and any general set-theoretic conclusions are NOT independently certified. This manuscript is a LOCAL UNACCEPTED EDITORIAL DRAFT.
What remains
Source-review Ch13, CFGHUZ15 and LPZ26 with exact geometric hypotheses, independently verify the nine-point enumeration, and investigate sharp planar exponent gaps while preserving stronger all-distances-distinct requirement versus #1207.
Mathematical source fidelity, any independent critical review, protected V2 editorial admission and live public deployment are distinct unfinished gates.
Sources and claim boundaries
https://www.erdosproblems.com/1208 ; [Er57b],[Er80,p.110],[Ch13],[LPZ26],[CFGHUZ15], #1207.
Finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE25.json. Original issue SHA/identity frozen and checked.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2479 — 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.