Antipaths in oriented graphs
Abstract
We show that for any natural number k 1, any oriented graph D of minimum semidegree at least (3k- 2)/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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.