paper

(Claw, C_3)-free digraphs with unbounded dichromatic number

arXiv:2602.08736

Abstract

We construct orientations of rook graphs (whose underlying graphs are claw-free) that contain no directed but have unbounded dichromatic number. This disproves a conjecture of Aboulker, Charbit and Naserasr and improves a result of Carbonero, Koerts, Moore and Spirkl.

(Claw, C_3)-free digraphs with unbounded dichromatic number · wovepaper