Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 49 min ago
PreprintCC BY-NC-SA 4.0arXiv

A Proof of the Linear Hadwiger Conjecture

  • Sergey Norin
  • Raphael Steiner
Open at sourcePDFDOICite

Abstract

We show that there exists C∈ℕ such that Kt-minor free graphs are Ct-colorable. The proof was found by GPT-6 Astra, following the directions by the authors.

Related

  1. A shorter proof of the linear list Hadwiger conjecture
    Yangyan Gu, Rongxing Xu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Beyond halfway to Hadwiger's conjecture
    Chun-Hung Liu, Jason Luo
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Fractional illumination and the optimal exponential rate in Hadwiger's covering conjecture
    Yegor Gorodzha
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  4. Tweaking the constant in the Linear Hadwiger Theorem
    David R. Wood
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Disproof of the dominating Hadwiger conjecture
    Freddie Illingworth, Raphael Steiner
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{norin2026proof,
  title = {{A Proof of the Linear Hadwiger Conjecture}},
  author = {Sergey Norin and Raphael Steiner},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.05291},
  eprint = {2610.05291},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.05291},
  note = {CC BY-NC-SA 4.0},
}
RIS
TY  - UNPB
TI  - A Proof of the Linear Hadwiger Conjecture
AU  - Sergey Norin
AU  - Raphael Steiner
PY  - 2026
DA  - 2026/10/04
PB  - arXiv
DO  - 10.48550/arxiv.2610.05291
UR  - https://arxiv.org/abs/2610.05291
AB  - We show that there exists C∈ℕ such that K_t-minor free graphs are Ct-colorable. The proof was found by GPT-6 Astra, following the directions by the authors.
ER  -