Linkages in locally semicomplete digraphs and quasi-transitive digraphs (Q1297397)

A digraph is locally semicomplete if the out-set and in-set of each vertex are semicomplete, that is, any two vertices are joined by at least one edge. A digraph is quasi-transitive if, for each path \(xyz\), the digraph contains at least one of the edges \(xz\) or \(zx\). The author shows that a digraph which is either locally semicomplete or quasi-transitive is strongly \(k\)-linked provided the connectivity is large enough. He also describes a polynomial time algorithm for the \(2\)-linkage problem for quasi-transitive digraphs.