On heroes in digraphs with forbidden induced forests
Abstract
We continue a line of research which studies which hereditary families of digraphs have bounded dichromatic number. For a class of digraphs , a hero in is any digraph such that -free digraphs in have bounded dichromatic number. We show that if is an oriented star of degree at least five, the only heroes for the class of -free digraphs are transitive tournaments. For oriented stars of degree exactly four, we show the only heroes in -free digraphs are transitive tournaments, or possibly special joins of transitive tournaments. Aboulker et al. characterized the set of heroes of -free digraphs almost completely, and we show the same characterization for the class of -free digraphs. Lastly, we show that if we forbid two "valid" orientations of brooms, then every transitive tournament is a hero for this class of digraphs.
Cite
@article{arxiv.2306.04710,
title = {On heroes in digraphs with forbidden induced forests},
author = {Alvaro Carbonero and Hidde Koerts and Benjamin Moore and Sophie Spirkl},
journal= {arXiv preprint arXiv:2306.04710},
year = {2023}
}