Coloring t-perfect graphs with fewer colors

arXiv:2607.05961 · math.CO, cs.DM · Submitted 2026-07-07 · Read on arXiv

math.CO, cs.DM

Submitted: 2026-07-07

Updated: 2026-10-29

Comments: 16 pages. v2: improved bound from 186 to 130, corrected a minor mistake, and improved figures

License: http://creativecommons.org/licenses/by/4.0/

The gist: Recently, Chudnovsky, Cook, Davies, Oum, and Tan obtained the first finite bound on the chromatic number of t-perfect graphs, showing that they are 199053-colorable.

Terminology

Abstract

Recently, Chudnovsky, Cook, Davies, Oum, and Tan obtained the first finite bound on the chromatic number of t-perfect graphs, showing that they are 199053-colorable. We improve this bound to 130 by refining their proof. The original proof establishes that every graph with large odd girth and large chromatic number contains a certain structure called an r-arithmetic rope, and that its existence in a certain leveling of a graph with large odd girth would imply an odd wheel as a t-minor, a known obstruction to t-perfectness. While their technique requires a lower bound on the chromatic number that is exponential in r, we show that the existence of an r-arithmetic rope can already be guaranteed under a linear bound. Using a slightly weakened notion of arithmetic ropes allows us to reduce the bound even further.

Related papers