arXiv (All)
open access
Every graph with no $K_7^=$ minor is 6-colorable
The first open case of Hadwiger's conjecture states that every $K_7$-minor-free graph is 6-colorable. We prove that this is the case for $K_7^=$-minor-free graphs, where $K_7^=$ denotes the graph obtained from $K_7$ by deleting two independent edges. The proof is based on an independently interestin
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Degreewise Cut-Semigroup Saturation for $K_5$-Minor-Free Graphs and Seymour's Planar Edge-Colouring Conjecture#1070206
- Proof of the Clustered Hadwiger Conjecture#1123899
- The Adams conjecture#610724
- On Kotzig's conjecture in random graphs#1115484
- Constrained Ramsey numbers for rainbow $P_5$#1129129
Record · ID 1011483
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive