2026/07/27 by Yuping Gao, Allan Lo
#math.CO
An antidirected path is an oriented path in which every vertex sees either just incoming or just outgoing edges. We prove that every oriented graph with minimum semidegree at least k contains an antidirected path of length 2 k -1. This confirms a conjecture of Stein.