Abstract
We show that digraphs with no transitive tournament on vertices and in which every induced directed cycle has length 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).
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.