OpenAlex ·
Tweaking the constant in the Linear Hadwiger Theorem
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.10831
- Original
- Read it at the publisher
- Topics
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.
More in Computational Complexity
A deterministic algorithm for signing bipartite graphs at the Ramanujan bound
The chromatic number of the associahedron: simple and logarithmic
Moment Methods for Uniform Average Mixing on Strongly Regular Graphs
Mutually unbiased bases: common states, completion, and extension obstructions
Smallest String Attractors and Minimal Coverage Certificates of Thue--Morse Words
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.