Blow-ups and extensions of trees in tournaments

Pierre Aboulker, Frédéric Havet, William Lochet +3

A class of acyclic digraphs $\mathcal{C}$ is linearly unavoidable if there exists a constant $c$ such that every digraph $D\in \mathcal{C}$ is contained in all tournaments of order…