Metraipolis › archive › dc_148934e1ea96
Two-block paths in oriented graphs under the Ore-type condition — arXiv:2611.04691
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04691
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T19:00:21.169Z
- SHA-256 of the archived text
ab4c7c5d5000bd6f3c195aa284e427f6ffca160c3a7ef04ca8b79b4fcbcd5e51- Stable URL of this page
https://metraipolis.com/documento/dc_148934e1ea96
How to cite
Two-block paths in oriented graphs under the Ore-type condition — arXiv:2611.04691 — arXiv (en), https://arxiv.org/abs/2611.04691 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_148934e1ea96 (Metraipolis archive dc_148934e1ea96, sha256 ab4c7c5d5000bd6f3c195aa284e427f6ffca160c3a7ef04ca8b79b4fcbcd5e51)
BibTeX
@misc{dc148934e1ea96,
title = {Two-block paths in oriented graphs under the Ore-type condition — arXiv:2611.04691},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04691},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_148934e1ea96; sha256 ab4c7c5d5000bd6f3c195aa284e427f6ffca160c3a7ef04ca8b79b4fcbcd5e51},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04691. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Stein conjectured that for every positive integer $k$, every oriented graph with minimum semi-degree greater than $k/2$ contains every oriented path of length $k$ [Springer this http URL . 165 (2020), 459--486]. For directed paths this is a classical result of Jackson (1981). The two-block case of the conjecture was established by Chen, Hou and Zhou (2025). In this paper we prove the two-block analogue of Jackson's theorem. For all positive integers $s$ and $r$, let $P(s,r)$ be the oriented path consisting of two directed paths of lengths $s$ and $r$ with a common terminal vertex, and let $Q(s,r)$ be its reverse. We show that for all $K\ge3$ and all $s,r\ge1$ with $s+r\le K$, every oriented graph $D$ with $\delta(D)\ge K$ and $d_D^+(u)+d_D^-(v)\ge K-1$ for every ordered pair of distinct vertices $(u,v)\notin A(D)$ contains both $P(s,r)$ and $Q(s,r)$. Our result is the two-block analogue of Jackson's theorem, and it extends the two-block result of Chen, Hou and Zhou. The proof iterates a shift of the terminal vertex of a longest path. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2611.04691 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T18:38:22.317Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).