Erdős Problem #706
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: graph theory, 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 L(r) be the smallest universal number of colours needed to properly colour every finite planar distance graph in which edges have length in some specified set A of exactly r positive distances. The question is whether L(r) is bounded by a POLYNOMIAL in r. The maintained status is OPEN. An arbitrary distance set A is fixed for each graph, and all edges corresponding to its listed lengths count; changing A or allowing different palettes per distance is only a proof technique.
A small example
When r=1, the question is the Hadwiger–Nelson problem, with 5≤L(1)≤7. For r=2, choose collinear points 0,1,2 with A={1,2}; they form a triangle K3 and require three colours, a finite lower fixture. Any finite chromatic number must be at least the clique number, but small examples do not determine asymptotic growth.
What is known
There is an elementary exponential upper bound L(r)≤7^r from the known 7-colouring of the Euclidean plane avoiding one specified distance. For each distance d∈A, rescale that fixed 7-colouring to avoid d, and label every point by the r-tuple of its colours. When two points have distance in A, the corresponding coordinate differs, so the tuple is a proper colouring; at most 7^r colours occur. The scaling requires d>0. This proves FINITENESS but does not approach r^O(1). The maintained source only gives the open polynomial question and L1 bounds.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: polynomial lr open; elementary 7 to r upper not polynomial. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Investigate whether colourings for different forbidden distances can reuse classes to improve 7^r, or construct an exact family of planar distance graphs giving superlinear lower bounds. Acceptance is one rigorous finite combinatorial inequality (e.g. product colouring bound, already established) and a source-grounded discussion of where polynomial reduction would require new structure.
Sources and claim boundaries
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1977 — 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.