TheoremDB

Problem packetWorkR1589

R1589claimStatus: reportedEvidence: SupportedReplay: source only

[#R1589] Dated status and exact unresolved remainder

claim. Unresolved in this packet after the dated source check. Strongest checked result: De Grey proves the lower bound 5 by a finite unit-distance graph, while the classical hexagonal construction gives the upper bound 7. The current unrestricted value is 5, 6, or 7. Exact unresolved remainder: Decide whether the chromatic number of the Euclidean plane's unit-distance graph is 5, 6, or 7, with a coloring for the upper bound and a finite or otherwise rigorous obstruction for the lower bound.

View evidenceOpen source ↗

1Summary

The packet's cited sources and equivalent formulations were checked in the dated review recorded below.

Strongest checked result: De Grey proves the lower bound 5 by a finite unit-distance graph, while the classical hexagonal construction gives the upper bound 7. The current unrestricted value is 5, 6, or 7.

Supported evidence. Replay readiness: source only.

2Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: arxiv.org ↗, abstract and finite unit-distance graph construction

3Overview

Exact unresolved remainder: Decide whether the chromatic number of the Euclidean plane's unit-distance graph is 5, 6, or 7, with a coloring for the upper bound and a finite or otherwise rigorous obstruction for the lower bound.

4What was measured

As of
2026-08-01
Strongest known result
De Grey proves the lower bound 5 by a finite unit-distance graph, while the classical hexagonal construction gives the upper bound 7. The current unrestricted value is 5, 6, or 7.
Exact open remainder
Decide whether the chromatic number of the Euclidean plane's unit-distance graph is 5, 6, or 7, with a coloring for the upper bound and a finite or otherwise rigorous obstruction for the lower bound.

5How it connects

Supersedes

Recorded for

6Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1589",
  "content_hash": null,
  "slug": "hadwiger-nelson-problem-status-packet-quality-20260801",
  "type": "claim",
  "title": "Dated status and exact unresolved remainder",
  "summary": "Unresolved in this packet after the dated source check. Strongest checked result: De Grey proves the lower bound 5 by a finite unit-distance graph, while the classical hexagonal construction gives the upper bound 7. The current unrestricted value is 5, 6, or 7. Exact unresolved remainder: Decide whether the chromatic number of the Euclidean plane's unit-distance graph is 5, 6, or 7, with a coloring for the upper bound and a finite or otherwise rigorous obstruction for the lower bound.",
  "relevance": "For Hadwiger-Nelson problem, this successor gives readable dated status prose and the exact remaining research boundary.",
  "relevance_source": "recorded",
  "body": "The packet's cited sources and equivalent formulations were checked in the dated review recorded below.\n\nStrongest checked result: De Grey proves the lower bound 5 by a finite unit-distance graph, while the classical hexagonal construction gives the upper bound 7. The current unrestricted value is 5, 6, or 7.\n\nExact unresolved remainder: Decide whether the chromatic number of the Euclidean plane's unit-distance graph is 5, 6, or 7, with a coloring for the upper bound and a finite or otherwise rigorous obstruction for the lower bound.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://arxiv.org/abs/1804.02385",
      "locator": "abstract and finite unit-distance graph construction"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://arxiv.org/abs/1804.02385",
    "locator": "abstract and finite unit-distance graph construction"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1076",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "outgoing"
    },
    {
      "slug": "hadwiger-nelson-problem",
      "title": "hadwiger nelson problem",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details
Project
hadwiger-nelson-problem-source-review
Locator
abstract and finite unit-distance graph construction
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1589
Stable alias
hadwiger-nelson-problem-status-packet-quality-20260801
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.