Invertibility of digraphs and tournaments

Noga Alon, Emil Powierski, Michael Savery +2

For an oriented graph $D$ and a set $X\subseteq V(D)$, the inversion of $X$ in $D$ is the digraph obtained by reversing the orientations of the edges of $D$ with both endpoints in…