A new connectivity bound for a tournament to be highly linked

Bin Chen, Xinmin Hou, Gexin Yu +1

A digraph $D$ is $k$-linked if for any pair of two disjoint sets $\{x_1,x_2,\dots ,x_k\}$ and $\{y_1,y_2,\dots ,y_k\}$ of vertices in $D$, there exist vertex disjoint d…