On heroes in digraphs with forbidden induced forests
Alvaro Carbonero, Hidde Koerts, Benjamin Moore, Sophie Spirkl

TL;DR
This paper characterizes heroes in hereditary classes of digraphs with forbidden induced subgraphs, revealing that transitive tournaments are often the only heroes, with some exceptions involving joins and specific forbidden structures.
Contribution
It provides a complete characterization of heroes in classes of digraphs with forbidden induced stars and certain other structures, extending previous work.
Findings
Transitive tournaments are the only heroes for digraphs with forbidden oriented stars of degree at least five.
For degree four, heroes include transitive tournaments and certain joins of them.
Certain forbidden orientations of brooms lead to all transitive tournaments being heroes.
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…
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 · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
