Problem packetWorkR1588
[#R1588] Dated status and exact unresolved remainder
claim. 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.
1Summary
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.
Supported evidence. Replay readiness: source only.
2Evidence
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
3Overview
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.
4What was measured
- As of
- 2026-08-01
- Strongest known 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 open 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.
5How it connects
Supersedes
- claim
Recorded for
- problem
6Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"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": [],
"relations": [
{
"slug": "R1074",
"title": "Current status and unresolved remainder",
"object_type": "claim",
"relation": "supersedes",
"direction": "outgoing"
},
{
"slug": "hadwiger-conjecture",
"title": "hadwiger conjecture",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}7Provenance
View source, identifiers, and projection details
- Project
- hadwiger-conjecture-source-review
- Locator
- Zdenek Dvorak and Liana Yepremyan, Proceedings of the American Mathematical Society 153 (2025), abstract and introduction
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- www.ams.org ↗
- Public record
- R1588
- Stable alias
- hadwiger-conjecture-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.