Completely strong path-connectivity of local tournaments (Q2761065)

A digraph \(T\) is completely strong path-connected if for every arc \((a,b)\) of \(T\) and every integer \(k\), \(2\leq k\leq n-1\), there is a path \(P_k(a,b)\) of length \(k\) from \(b\) to \(a\) and a path \(P'_k(a,b)\) of length \(k\) from \(a\) to \(b\) in \(T\). A local tournament is a digraph such that both the in-neighborhood and the out-neighborhood of every of its vertices induces a tournament. The main result of the paper shows that a connected local tournament is completely strong path-connected if and only if for every of its arcs \((a,b)\) there is both a path \(P_2(a,b)\) and a path \(P'_2(a,b)\) in \(T\), with one single exception and two infinite classes of exceptions.