Antipaths in oriented graphs

From MaRDI portal
Publication:6098098




Abstract: We show that for any natural number kge1, any oriented graph D of minimum semidegree at least (3k2)/4 contains an antidirected path of length k. In fact, a slightly weaker condition on the semidegree sequence of D suffices, and as a consequence, we confirm a weakened antidirected path version of a conjecture of Addario-Berry, Havet, Linhares Sales, Thomass'e and Reed.









This page was built for publication: Antipaths in oriented graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098098)