2022/02/02 by P Aboulker, Nicolás Bousquet, Aboulker, Pierre +3
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.2202.01006
openalex publication_date 2022/02/02 · openalex created_date 2022/05/05 · openalex updated_date 2026/07/28
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).