  We show that digraphs with no transitive tournament on $3$ vertices and in
which every induced directed cycle has length $3$ can have arbitrarily large
dichromatic number. This answers to the negative a question of Carbonero,
Hompe, Moore, and Spirkl (and extends some of their results).

Combinatorics