Paths with two blocks in oriented graphs of large minimum semi-degree
The electronic journal of combinatorics, Tome 32 (2025) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Stein (2020) conjectured that for any positive integer $k$, every oriented graph of minimum semi-degree greater than $k/2$ contains every oriented path of length $k$. This conjecture is true by a result from Jackson (JGT, 1981), where he demonstrated that every oriented graph of minimum semi-degree at least $k/2$ includes a directed path of length $k$. In this paper, we establish the validity of Stein's conjecture specifically for any oriented path with two blocks, where, a block of an oriented path $P$ refers to a maximal directed subpath within $P$.
DOI : 10.37236/13005
Classification : 05C20, 05C38

Bin Chen    ; Xinmin Hou  1   ; Xinyu Zhou 

1 University of Science and Technology of China
@article{10_37236_13005,
     author = {Bin Chen and Xinmin Hou and Xinyu Zhou},
     title = {Paths with two blocks in oriented graphs of large minimum semi-degree},
     journal = {The electronic journal of combinatorics},
     year = {2025},
     volume = {32},
     number = {4},
     doi = {10.37236/13005},
     zbl = {arXiv:2512.04423},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/13005/}
}
TY  - JOUR
AU  - Bin Chen
AU  - Xinmin Hou
AU  - Xinyu Zhou
TI  - Paths with two blocks in oriented graphs of large minimum semi-degree
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/13005/
DO  - 10.37236/13005
ID  - 10_37236_13005
ER  - 
%0 Journal Article
%A Bin Chen
%A Xinmin Hou
%A Xinyu Zhou
%T Paths with two blocks in oriented graphs of large minimum semi-degree
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/13005/
%R 10.37236/13005
%F 10_37236_13005
Bin Chen; Xinmin Hou; Xinyu Zhou. Paths with two blocks in oriented graphs of large minimum semi-degree. The electronic journal of combinatorics, Tome 32 (2025) no. 4. doi: 10.37236/13005

Cité par Sources :