Stein's minimum semi-degree conjecture for oriented paths
Let be an oriented graph, let be a positive integer, and write for the minimum semi-degree. An oriented path of length is a path on vertices with an arbitrary orientation of its edges.
Stein's conjecture. If
then contains every oriented path of length .
This is the explicitly labelled conjecture introduced after earlier results on long directed paths and cycles. The supplied text gives no resolution status for it.
References
- Bin Chen, Xinmin Hou and Xinyu Zhou, “Paths with two blocks in oriented graphs of large minimum semi-degree”, arXiv:2512.04423 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.