Forbidden Tournaments and the Orientation Completion Problem

Manuel Bodirsky, Santiago Guzmán-Pro

For a fixed finite set of finite tournaments $\mathcal{F}$, the $\mathcal{F}$-free orientation problem asks whether a given finite undirected graph $G$ has an $\mathcal{F}$-free o…