Chordal directed graphs are not \(\chi\)-bounded

DOI10.37236/11050zbMATH Open1493.05130arXiv2202.01006OpenAlexW4229027250MaRDI QIDQ2138574

Author name not available (Why is that?)

Publication date: 12 May 2022

Published in: (Search for Journal in Brave)

Abstract: 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).

Full work available at URL: https://arxiv.org/abs/2202.01006

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Chordal directed graphs are not \(\chi\)-bounded

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138574)