Sharp quadratic $χ$-binding functions for powers of bipartite graphs

Abstract

For every natural number $r\geq 2$, we construct $r^{th}$ powers of bipartite graphs whose chromatic number is quadratic in their clique number, showing that the straightforward quadratic upper bound is best possible. We thereby settle an open problem posed by Chakraborty, Chandran, Jacob and Pillai [J. Graph Theory 112(3) (2026), 235-254] by establishing the sharpness of the quadratic bound for squares of bipartite graphs.