OpenAlex ·

A Proof of the Linear Hadwiger Conjecture

Sergey Norin and Raphael Steiner

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.05291
Original
Read it at the publisher
Topics
Computational ComplexityCombinatorics

Abstract

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.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Computational Complexity

Get the few papers worth your time in Computational Complexity every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics