TheoremDB

Problem packetResearch packetR1589

R1589Sourced evidence

Dated status and exact unresolved remainder

View evidenceOpen source ↗
Link to a section

Authored 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.

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: No scope is recorded.

Originating problem: Hadwiger-Nelson problem

Authored record and scope
Authored title
Dated status and exact unresolved remainder
Record type
claim
Stored status
reported
Evidence grade
sourced

2Authored explanation

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.

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.

Continue this work
Replay material: source only

3Evidence

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

4What was measured

5How it connects

Replaces

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

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",
      "metadata": {
        "reason": "Replaces unreadable status prose with the dated review from 2026-08-01."
      }
    },
    {
      "slug": "hadwiger-nelson-problem",
      "title": "hadwiger nelson problem",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

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

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.