Antipaths in oriented graphs

From MaRDI portal
Publication:6098098

DOI10.1016/J.DISC.2023.113515zbMATH Open1516.05109arXiv2212.09876OpenAlexW4379356442MaRDI QIDQ6098098FDOQ6098098


Authors: Tereza Klimošová, Maya Stein Edit this on Wikidata


Publication date: 12 June 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2212.09876




Recommendations




Cites Work


Cited In (4)





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)