Antidirected paths in oriented graphs

Andrzej Grzesik, Marek Skrzypczyk

We show that for any integer $k\ge 4$, every oriented graph with minimum semidegree bigger than $\frac{1}{2}(k-1+\sqrt{k-3})$ contains an antidirected path of length $k$. Conseque…