OpenAlex ·

Tweaking the constant in the Linear Hadwiger Theorem

David R. Wood

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

Abstract

Norin and Steiner recently proved the Linear Hadwiger Conjecture. That is, there is an absolute constant $C$ such that every graph $G$ satisfies $χ(G)\leqslant C\,\text{had}(G)$, where $χ(G)$ is the chromatic number and $\text{had}(G)$ is the Hadwiger number of $G$. They estimate that their proof gives a non-optimised constant $C$ of order $10^{100}$. This paper uses AI assistance to optimise their argument, and shows that every graph $G$ satisfies $χ(G)\,\leqslant\,1{,}118{,}430\,\text{had}(G)$.

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