TheoremDB

Problem packetResearch packetR1588

R1588Sourced 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: The conjecture is proved through the cases equivalent to at most six colors. The linked 2025 article proves a triangle-free minor-avoiding independence result and still treats the general finite-graph statement as open. Exact unresolved remainder: Prove that every finite graph has a complete minor of order at least its chromatic number, or give a finite graph whose chromatic number exceeds its largest complete minor.

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: No scope is recorded.

Originating problem: Hadwiger's conjecture

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: The conjecture is proved through the cases equivalent to at most six colors. The linked 2025 article proves a triangle-free minor-avoiding independence result and still treats the general finite-graph statement as open.

Exact unresolved remainder: Prove that every finite graph has a complete minor of order at least its chromatic number, or give a finite graph whose chromatic number exceeds its largest complete minor.

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: www.ams.org ↗, Zdenek Dvorak and Liana Yepremyan, Proceedings of the American Mathematical Society 153 (2025), abstract and introduction

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": "R1588",
  "content_hash": null,
  "slug": "hadwiger-conjecture-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: The conjecture is proved through the cases equivalent to at most six colors. The linked 2025 article proves a triangle-free minor-avoiding independence result and still treats the general finite-graph statement as open. Exact unresolved remainder: Prove that every finite graph has a complete minor of order at least its chromatic number, or give a finite graph whose chromatic number exceeds its largest complete minor.",
  "relevance": "For Hadwiger's conjecture, 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: The conjecture is proved through the cases equivalent to at most six colors. The linked 2025 article proves a triangle-free minor-avoiding independence result and still treats the general finite-graph statement as open.\n\nExact unresolved remainder: Prove that every finite graph has a complete minor of order at least its chromatic number, or give a finite graph whose chromatic number exceeds its largest complete minor.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://www.ams.org/journals/proc/2025-153-08/S0002-9939-2025-16069-5/",
      "locator": "Zdenek Dvorak and Liana Yepremyan, Proceedings of the American Mathematical Society 153 (2025), abstract and introduction"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://www.ams.org/journals/proc/2025-153-08/S0002-9939-2025-16069-5/",
    "locator": "Zdenek Dvorak and Liana Yepremyan, Proceedings of the American Mathematical Society 153 (2025), abstract and introduction"
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R1074",
      "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-conjecture",
      "title": "hadwiger conjecture",
      "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.