On \(d\)-panconnected tournaments with large semidegrees (Q2142665)

The following statement on regular tournaments is the main result of the paper: Let \(T\) be a regular tournament of order \(2n + 1 \geq 11\) and \(S\) a subset of \(V (T)\). Suppose that \(\mid S\mid \leq \frac{1}{2} (n-2) \) and \(x, y\) are distinct vertices in \(V (T ) \backslash S\). If the subtournament \(T-S\) contains an \((x, y)\)-path of length \(r\), where \(3 \leq r \leq \mid V (T) \ S \mid-2\), then \(T-S\) also contains an \((x, y)\)-path of length \(r +1\).