(Claw, C_3)-free digraphs with unbounded dichromatic number
Guillaume Aubian, Luis Kuffner

TL;DR
This paper constructs specific orientations of claw-free graphs that lack directed 3-cycles but have unbounded dichromatic number, disproving a previous conjecture and advancing understanding of graph orientations.
Contribution
It provides a counterexample to a conjecture by constructing orientations of claw-free graphs with unbounded dichromatic number and no directed 3-cycle.
Findings
Disproved a conjecture on dichromatic number in claw-free graphs
Constructed orientations with unbounded dichromatic number and no directed C3
Improved upon previous results in graph orientation theory
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Advanced Combinatorial Mathematics · Geometric and Algebraic Topology
