On the complete digraphs which are simply disconnected (Q1182645)

Homotopic methods are employed for the characterization of the complete digraphs which are the composition of non-trivial highly regular tournaments. It is proved that a complete digraph \(D\) is simply disconnected if and only if its simple quotient is a highly regular tournament. A complete digraph \(D_ n\) is simply disconnected if and only if (a) there exists in \(D_ n\) a non-coned 3-cycle; (b) every symmetric pair and every 3-cycle in \(D_ n\) is shrinkable in \(D_ n\).