arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.05205math.CO
收藏

有向图中的长反路径与反圈

Long antipaths and anticycles in oriented graphs

Bin Chen, Xinmin Hou, Hongyu Zhou

AI总结:

本文改进了有向图中反路径存在的度条件,证明了在最小伪半度 $\tildeδ^0(D)\ge(2k+1)/3$ 时必含长度至少为 $k+1$ 的反路径或反圈,并否定了 Klimousová 和 Stein 提出的一个问题。

摘要:

设 $δ^{0}(D)$ 为有向图 $D$ 的最小半度。Jackson (1981) 证明了当 $|V(D)|>2k+2$ 时,每个满足 $δ^{0}(D)\geq k$ 的有向图 $D$ 包含长度为 $2k$ 的有向路径;当 $|V(D)|\le 2k+2$ 时,包含有向 Hamilton 圈。Stein (2020) 进一步猜想,每个满足 $δ^{0}(D)>k/2$ 的有向图 $D$ 包含任意长度为 $k$ 的有向路径。最近,Klimousová 和 Stein (DM, 2023) 引入了最小伪半度 $\tildeδ^0(D)$(由于 $\tildeδ^0(D)\ge δ^0(D)$,这比最小半度条件稍弱),并证明了对于 $k\geq 3$,每个满足 $\tildeδ^{0}(D)\ge (3k-2)/4$ 的有向图 $D$ 包含每条长度为 $k$ 的反路径。本文改进了 Klimousová 和 Stein 的结果,证明了对于所有 $k\geq 2$,每个满足 $\tildeδ^0(D)\ge(2k+1)/3$ 的有向图包含长度至少为 $k+1$ 的反路径或长度至少为 $k+1$ 的反圈。此外,我们对 Klimousová 和 Stein 提出的一个问题给出了否定回答。

英文摘要:

Let $δ^{0}(D)$ be the minimum semi-degree of an oriented graph $D$. Jackson (1981) proved that every oriented graph $D$ with $δ^{0}(D)\geq k$ contains a directed path of length $2k$ when $|V(D)|>2k+2$, and a directed Hamilton cycle when $|V(D)|\le 2k+2$. Stein~(2020) further conjectured that every oriented graph $D$ with $δ^{0}(D)>k/2$ contains any orientated path of length $k$. Recently, Klimousová and Stein (DM, 2023) introduced the minimum pseudo-semi-degree $\tildeδ^0(D)$ (a slight weaker than the minimum semi-degree condition as $\tildeδ^0(D)\ge δ^0(D))$ and showed that every oriented graph $D$ with $\tildeδ^{0}(D)\ge (3k-2)/4$ contains each antipath of length $k$ for $k\geq 3$. In this paper, we improve the result of Klimousová and Stein by showing that for all $k\geq 2$, every oriented graph with $\tildeδ^0(D)\ge(2k+1)/3$ contains either an antipath of length at least $k+1$ or an anticycle of length at least $k+1$. Furthermore, we answer a problem raised by Klimousová and Stein in the negative.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑