Blow-ups and extensions of trees in tournaments
Pierre Aboulker, Fr\'ed\'eric Havet, William Lochet, Raul Lopes, Lucas, Picasarri-Arrieta, Cl\'ement Rambaud

TL;DR
This paper extends the class of acyclic digraphs known to be linearly unavoidable in tournaments, including those formed from oriented trees with added vertices or blow-ups, providing explicit bounds for containment.
Contribution
It generalizes previous results by proving that certain complex acyclic digraphs derived from oriented trees are linearly unavoidable in tournaments, with explicit size bounds.
Findings
Acyclic digraphs from oriented trees with added universal vertices are contained in all large enough tournaments.
Blow-ups of oriented trees are also contained in all sufficiently large tournaments.
Provides explicit bounds on tournament size needed for containment of these digraphs.
Abstract
A class of acyclic digraphs is linearly unavoidable if there exists a constant such that every digraph is contained in all tournaments of order . The class of all acyclic digraphs is not linearly avoidable, and Fox, He, and Widgerson recently showed that this is not even the case for acyclic digraphs with bounded maximum degree. On the positive side, Thomason and H\"aggkvist proved that the class of oriented trees is linearly unavoidable. In this work, we generalize this result to acyclic digraphs obtained from an oriented tree by adding at most vertices, and -blow-ups of oriented trees, for every fixed integer . More precisely, we show that if is obtained from an oriented tree of order by adding universal vertices, then is contained in every tournament of order ; and if…
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 · Graph theory and applications · Limits and Structures in Graph Theory
