Two-block paths in oriented graphs under the Ore-type condition
Stein conjectured that for every positive integer $k$, every oriented graph with minimum semi-degree greater than $k/2$ contains every oriented path of length $k$ [Springer Optim.Appl. 165 (2020), 459--486]. For directed paths this is a classical result of Jackson (1981). The two-block case of the conjecture was establ...