Back to paper list

Expositio paper exp-20260807-9c0bc6

How Close Can a Chromatic Root Get to One?

Preprint

In this paper we show that the chromatic function $P(G,t)$ is always a polynomial. We then ask a simple question: where does this polynomial equal zero? Tutte showed that two stretches of the real line, $(-\infty,0)$ and $(0,1)$, can never contain a root. Jac…

Selected public version
exp-20260807-9c0bc6v1 Latest public version Public since August 7, 2026 Submitted August 7, 2026 0 saves
Main field
Main topics
Reading-list context
Current reading
Journal publication
Selected public version
Archive state
Public versions

Authors

Arnav Dhiman

Abstract

In this paper we show that the chromatic function $P(G,t)$ is always a polynomial. We then ask a simple question: where does this polynomial equal zero? Tutte showed that two stretches of the real line, $(-\infty,0)$ and $(0,1)$, can never contain a root. Jackson showed in 1993 that no root can lie between $1$ and $32/27$ either, and that this bound is sharp. We prove both of these results from scratch, along with all the tools needed to get there, and we close by looking at what has been discovered about this threshold since 1993.

Domains and classifications

Mathematics
Main field
Combinatorics Graph theory Coloring of graphs and hypergraphs

Version history

Expositio keeps public paper versions together so readers can see the current PDF while still understanding how the record has changed.

exp-20260807-9c0bc6v1

How Close Can a Chromatic Root Get to One?

Preprint
Uploaded Aug 7, 2026 287456 bytes Selected Latest
Cite this version
BibTeX Download
Chicago Download