arXiv (OAI Expanded)
open access
Proof of the Clustered Hadwiger Conjecture
Hadwiger's Conjecture asserts that every $K_h$-minor-free graph is properly $(h-1)$-colourable. We prove the following improper analogue of Hadwiger's Conjecture: for fixed $h$, every $K_h$-minor-free graph is $(h-1)$-colourable with monochromatic components of bounded size. The number of colours is
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
- Every graph with no $K_7^=$ minor is 6-colorable#1011483
- Forcing monochromatic subdivisions#820059
- Degeneracy bounds, stability, and a sharp gap for $B$-colorings#924967
- Degeneracy bounds, stability, and a sharp gap for $B$-colorings#920733
- Graph Coloring with Color Preferences#820007
Record · ID 1123899
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