Chromatic discrepancy of locally $s$-colourable graphs

Timothée Corsini, Lucas Picasarri-Arrieta, Théo Pierron +2

The chromatic discrepancy of a graph $G$, denoted $\ddot{I}•(G)$, is the least over all proper colourings $\ddot{I}ƒ$ of $G$ of the greatest difference between the number of colours $|\ddot{I}ƒ(V(H))|$…