{"doi":"10.1016/j.ejc.2024.104104","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.ejc.2024.104104"}],"arxiv":1,"volume":125,"quality_controlled":"1","scopus_import":"1","corr_author":"1","external_id":{"arxiv":["2306.04710"]},"intvolume":"       125","_id":"18753","acknowledgement":"We thank the anonymous referees for their careful proofreading which helped improve the presentation of this paper. We also thank one of the anonymous referees for pointing out our construction implies Theorem 1.7!","author":[{"first_name":"Alvaro","full_name":"Carbonero, Alvaro","last_name":"Carbonero"},{"full_name":"Koerts, Hidde","first_name":"Hidde","last_name":"Koerts"},{"full_name":"Moore, Benjamin","id":"6dc1a1be-bf1c-11ed-8d2b-d044840f49d6","first_name":"Benjamin","last_name":"Moore"},{"first_name":"Sophie","full_name":"Spirkl, Sophie","last_name":"Spirkl"}],"title":"On heroes in digraphs with forbidden induced forests","department":[{"_id":"MaKw"}],"day":"26","publication_status":"epub_ahead","date_published":"2024-12-26T00:00:00Z","language":[{"iso":"eng"}],"abstract":[{"text":"We continue a line of research which studies which hereditary families of digraphs have bounded dichromatic number. For a class of digraphs  C, a hero in  C  is any digraph  H\r\n  such that  H -free digraphs in  C  have bounded dichromatic number. We show that if  F\r\n  is an oriented star of degree at least five, the only heroes for the class of  F -free digraphs are transitive tournaments. For oriented stars  F  of degree exactly four, we show the only heroes in  F -free digraphs are transitive tournaments, or possibly special joins of transitive tournaments. Aboulker et al. characterized the set of heroes of  {H,K1+P2→} -free digraphs almost completely, and we show the same characterization for the class of  {H,rK1+P3→} -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.","lang":"eng"}],"oa":1,"citation":{"ama":"Carbonero A, Koerts H, Moore B, Spirkl S. On heroes in digraphs with forbidden induced forests. <i>European Journal of Combinatorics</i>. 2024;125. doi:<a href=\"https://doi.org/10.1016/j.ejc.2024.104104\">10.1016/j.ejc.2024.104104</a>","apa":"Carbonero, A., Koerts, H., Moore, B., &#38; Spirkl, S. (2024). On heroes in digraphs with forbidden induced forests. <i>European Journal of Combinatorics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ejc.2024.104104\">https://doi.org/10.1016/j.ejc.2024.104104</a>","ieee":"A. Carbonero, H. Koerts, B. Moore, and S. Spirkl, “On heroes in digraphs with forbidden induced forests,” <i>European Journal of Combinatorics</i>, vol. 125. Elsevier, 2024.","short":"A. Carbonero, H. Koerts, B. Moore, S. Spirkl, European Journal of Combinatorics 125 (2024).","ista":"Carbonero A, Koerts H, Moore B, Spirkl S. 2024. On heroes in digraphs with forbidden induced forests. European Journal of Combinatorics. 125, 104104.","chicago":"Carbonero, Alvaro, Hidde Koerts, Benjamin Moore, and Sophie Spirkl. “On Heroes in Digraphs with Forbidden Induced Forests.” <i>European Journal of Combinatorics</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.ejc.2024.104104\">https://doi.org/10.1016/j.ejc.2024.104104</a>.","mla":"Carbonero, Alvaro, et al. “On Heroes in Digraphs with Forbidden Induced Forests.” <i>European Journal of Combinatorics</i>, vol. 125, 104104, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.ejc.2024.104104\">10.1016/j.ejc.2024.104104</a>."},"year":"2024","publisher":"Elsevier","type":"journal_article","date_created":"2025-01-05T23:01:55Z","date_updated":"2025-01-08T10:17:25Z","publication":"European Journal of Combinatorics","status":"public","month":"12","publication_identifier":{"issn":["0195-6698"]},"oa_version":"None","article_processing_charge":"No","article_number":"104104","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}