Every $(13k-6)$-strong tournament with minimum out-degree at least $28k-13$ is $k$-linked

Jørgen Bang-Jensen, Kasper Skov Johansen

A digraph $D$ is $k$-linked if it satisfies that for every choice of disjoint sets $\{x_1,\dots ,x_k\}$ and $\{y_1,\dots ,y_k\}$ of vertices of $D$ there are vertex disjoint pa…