Alternating Paths in Oriented Graphs with Large Semidegree
The Electronic Journal of Combinatorics · 03.11.2025 · 32 (4)
DOI: 10.37236/13084 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 03.11.2025. Verfasst von Jozef Skokan und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref).
Abstract (Originalsprache)
In new progress on conjectures of Stein, and Addario-Berry, Havet, Linhares Sales, Reed and Thomassé, we prove that every oriented graph with all in- and out-degrees greater than 5k/8 contains an alternating path of length k. This improves on previous results of Klimošová and Stein, and Chen, Hou and Zhou.
Zitieren
APA
Skokan, J., & Tyomkyn, M. (2025). Alternating Paths in Oriented Graphs with Large Semidegree. The Electronic Journal of Combinatorics, 32(4). https://doi.org/10.37236/13084
Vancouver
Skokan J, Tyomkyn M. Alternating Paths in Oriented Graphs with Large Semidegree. The Electronic Journal of Combinatorics. 2025;32(4). doi:10.37236/13084
BibTeX
@article{Skokan2025,
author = {Skokan, Jozef and Tyomkyn, Mykhaylo},
title = {Alternating Paths in Oriented Graphs with Large Semidegree},
journal = {The Electronic Journal of Combinatorics},
year = {2025},
volume = {32},
number = {4},
doi = {10.37236/13084}
}
EUVIMED