Skip to content

Erdős Problem #704

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: graph theory, geometry, chromatic number.

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

Let G_n be the infinite unit-distance graph of Euclidean R^n: vertices are all points and edges connect pairs exactly distance 1. Estimate its chromatic number χ(G_n), and does lim_{n→∞}χ(G_n)^(1/n) exist? The maintained source remains OPEN for a sharp exponential base and existence of the limit, even though EXPONENTIAL GROWTH ITSELF IS PROVED.

A small example

In R^1, edges connect points differing exactly 1. Colour x by parity of floor(x). If y=x+1, then floor(y)=floor(x)+1 and the colours differ. Therefore χ(G_1)=2, since the graph has an edge and admits a two-colouring. The finite regular simplex of n+1 points in R^n has every pair at distance 1, so χ(G_n)≥n+1, but this polynomial lower bound is much weaker than known exponential estimates.

What is known

Frankl–Wilson 1981 proved χ(G_n)≥(1+o(1))1.2^n; Raigorodsky 2000 improved its exponential lower base to 1.239... . Larman–Rogers 1972 proved χ(G_n)≤(3+o(1))^n, also re-proved by Prosanov 2020. These bounds establish exponential growth of chromatic number, but do not settle the EXISTENCE of χ(G_n)^(1/n) or its precise value. The cube-colouring bound (2+sqrt(n))^n is weaker. Maintained last revision 10 April 2026; original primary [Er81] not inspected.

GCL's current state

The authenticated original RESULT/1 source return retains its original BOUNDED_TASK_DESIGNED disposition and mathematical qualifications. This source-grounded explanation is editorially reviewed through the exact-hash EC-BULK-005-R8 protected transaction, effective on protected merge. It is not a fresh proof of the attributed mathematical theorem or an internally replayed Lean certificate.

Critical source-scope distinction: exponential lower and upper bound established, existence of exponential base limit OPEN.

What remains

Source-check the exact lower and upper exponential bases in Frankl–Wilson, Raigorodsky and Larman–Rogers, then explore whether product constructions yield submultiplicative or supermultiplicative inequalities sufficient for Fekete's lemma. Show precisely why no naive tensor colouring settles the limit. Finite χ(G_1)=2 is a fixture.

Sources and claim boundaries

Maintained Erdős #704, https://www.erdosproblems.com/704 ; https://www.erdosproblems.com/latex/704 ; [FrWi81],[Ra00],[LaRo72],[Pr20] complete original proof pages not all inspected. Authenticated source-return evidence. Historical full proofs not independently replayed. Historical full mathematical proof replay remains an open research obligation.

Editorial provenance: protected R8 source-critical review. Original issue-level source and research-proof holds remain. Status: REVIEWED explanatory article; full historical theorem proofs, unresolved conjectures and external Lean proofs are not newly certified.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1975 — 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