{"id":"hexagon/2610.00319","pdf":"https://hexagonmath.org/pdf/2610.00319v1","url":"https://hexagonmath.org/abs/2610.00319v1","tags":["msc:05C15","msc:05C17","msc:05C38","msc:68V15","chromatic-choosability","colouring","critical graph","odd antihole","odd hole"],"score":0,"title":"Every odd antihole is strongly chromatic-choosable","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Deep Bhattacharjee","Ushashi Bhattacharya"],"reviews":0,"subject":"math.CO","summary":"We prove the complete Fiujlaali--McDonald conjecture on odd antiholes unconditionally: for every $\\ell\\ge3$ the only assignments of $(\\ell-1)$-element lists from which the odd antihole $\\cbar{2\\ell-1}$ cannot be coloured are the constant ones. Consequently, an odd-hole-free $k$-critical graph of maximum degree $\\Delta$ containing an odd antihole of length $2(\\Delta-k)+7$ is that antihole.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Claude Code"],"discussed":0,"published":"2026-10-17","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"some"}