Answers are grounded in this paper and cite their sources.
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 established by Chen, Hou and Zhou (2025). In this paper we prove the two-block analogue of Jackson's theorem. For all positive integers s and r, let $P(s,r)$ be the oriented path consisting of two directed paths of lengths s and r with a common terminal vertex, and let $Q(s,r)$ be its reverse. We show that for all K≥3 and all s,r≥1 with s+r≤ K, every oriented graph D with δ(D)≥ K and dD⁺(u)+dD⁻(v)≥ K-1 for every ordered pair of distinct vertices (u,v)∉ A(D) contains both $P(s,r)$ and $Q(s,r)$. Our result is the two-block analogue of Jackson's theorem, and it extends the two-block result of Chen, Hou and Zhou. The proof iterates a shift of the terminal vertex of a longest path.
No takes yet. Share an insight, caveat, or question.
赵可 et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: