arXiv (All)
open access
A Proof of the Linear Hadwiger Conjecture
We show that there exists $C\in\mathbb{N}$ such that $K_t$-minor free graphs are $Ct$-colorable. The proof was found by GPT-6 Astra, following the directions by the authors.
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
- Identifying codes in triangle-free graphs of bounded maximum degree#1187198
- Counterexamples to the Strong Roberson Conjecture#1188228
- On the residual finiteness of the non-abelian exterior square of some Artin groups, constructible soluble groups, generalised Baumslag-Solitar groups and $SL_n(\Z)$#1186557
- Exploring Minimal Blocking Sets for Kernelization Lower Bounds for $\mathcal{F}$-Minor Deletion#1344216
Record · ID 1201304
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