<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>On heroes in digraphs with forbidden induced forests</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Alvaro</namePart>
  <namePart type="family">Carbonero</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Hidde</namePart>
  <namePart type="family">Koerts</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Benjamin</namePart>
  <namePart type="family">Moore</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">6dc1a1be-bf1c-11ed-8d2b-d044840f49d6</identifier></name>
<name type="personal">
  <namePart type="given">Sophie</namePart>
  <namePart type="family">Spirkl</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">MaKw</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>





<name type="corporate">
  <namePart>Randomness and structure in combinatorics</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">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
  such that  H -free digraphs in  C  have bounded dichromatic number. We show that if  F
  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 &quot;valid&quot; orientations of brooms, then every transitive tournament is a hero for this class of digraphs.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2025_EuropJournCombinatorics_Carbonero.pdf">https://research-explorer.ista.ac.at/download/18753/19577/2025_EuropJournCombinatorics_Carbonero.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Elsevier</publisher><dateIssued encoding="w3cdtf">2025</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>European Journal of Combinatorics</title></titleInfo>
  <identifier type="issn">0195-6698</identifier>
  <identifier type="arXiv">2306.04710</identifier>
  <identifier type="ISI">001400113700001</identifier><identifier type="doi">10.1016/j.ejc.2024.104104</identifier>
<part><detail type="volume"><number>125</number></detail>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<apa>Carbonero, A., Koerts, H., Moore, B., &amp;#38; Spirkl, S. (2025). On heroes in digraphs with forbidden induced forests. &lt;i&gt;European Journal of Combinatorics&lt;/i&gt;. Elsevier. &lt;a href=&quot;https://doi.org/10.1016/j.ejc.2024.104104&quot;&gt;https://doi.org/10.1016/j.ejc.2024.104104&lt;/a&gt;</apa>
<short>A. Carbonero, H. Koerts, B. Moore, S. Spirkl, European Journal of Combinatorics 125 (2025).</short>
<ista>Carbonero A, Koerts H, Moore B, Spirkl S. 2025. On heroes in digraphs with forbidden induced forests. European Journal of Combinatorics. 125, 104104.</ista>
<chicago>Carbonero, Alvaro, Hidde Koerts, Benjamin Moore, and Sophie Spirkl. “On Heroes in Digraphs with Forbidden Induced Forests.” &lt;i&gt;European Journal of Combinatorics&lt;/i&gt;. Elsevier, 2025. &lt;a href=&quot;https://doi.org/10.1016/j.ejc.2024.104104&quot;&gt;https://doi.org/10.1016/j.ejc.2024.104104&lt;/a&gt;.</chicago>
<ieee>A. Carbonero, H. Koerts, B. Moore, and S. Spirkl, “On heroes in digraphs with forbidden induced forests,” &lt;i&gt;European Journal of Combinatorics&lt;/i&gt;, vol. 125. Elsevier, 2025.</ieee>
<ama>Carbonero A, Koerts H, Moore B, Spirkl S. On heroes in digraphs with forbidden induced forests. &lt;i&gt;European Journal of Combinatorics&lt;/i&gt;. 2025;125. doi:&lt;a href=&quot;https://doi.org/10.1016/j.ejc.2024.104104&quot;&gt;10.1016/j.ejc.2024.104104&lt;/a&gt;</ama>
<mla>Carbonero, Alvaro, et al. “On Heroes in Digraphs with Forbidden Induced Forests.” &lt;i&gt;European Journal of Combinatorics&lt;/i&gt;, vol. 125, 104104, Elsevier, 2025, doi:&lt;a href=&quot;https://doi.org/10.1016/j.ejc.2024.104104&quot;&gt;10.1016/j.ejc.2024.104104&lt;/a&gt;.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>18753</recordIdentifier><recordCreationDate encoding="w3cdtf">2025-01-05T23:01:55Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-05-19T14:06:00Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
