Antipaths in oriented graphs
Discrete Mathematics · 2023-09 · 346 (9) · 113515
DOI: 10.1016/j.disc.2023.113515 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2023-09. Verfasst von Tereza Klimošová und 1 weiteren Autor:innen. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 14 Literaturangaben.
Abstract (Originalsprache)
We show that for any natural number $k \ge 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.
Zitieren
APA
Klimošová, T., & Stein, M. (2023). Antipaths in oriented graphs. Discrete Mathematics, 346(9), 113515. https://doi.org/10.1016/j.disc.2023.113515
Vancouver
Klimošová T, Stein M. Antipaths in oriented graphs. Discrete Mathematics. 2023;346(9):113515. doi:10.1016/j.disc.2023.113515
BibTeX
@article{Klimoov2023,
author = {Klimošová, Tereza and Stein, Maya},
title = {Antipaths in oriented graphs},
journal = {Discrete Mathematics},
year = {2023},
volume = {346},
number = {9},
pages = {113515},
doi = {10.1016/j.disc.2023.113515}
}
EUVIMED