Intrinsic linking and knotting in tournaments

Thomas Fleming, Joel Foisy

A directed graph $G$ is $\text{intrinsically linked}$ if every embedding of that graph contains a non-split link $L$, where each component of $L$ is a consistently oriented cycle…