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

诱导 $A$-路径定理

An Induced $A$-Path Theorem

Université libre de Bruxelles(布鲁塞尔自由大学)

Robert Hickingbotham, Gwenaël Joret

AI总结:

该研究推广了Gallai定理到诱导图设置,证明了在移除特定顶点集合后,图中存在一定数量的反完备诱导$\mathcal{A}$-路径,并优化了相关参数的上限。

摘要:

给定一个图 $G$ 和 $\mathcal{A}\subseteq V(G)$,Gallai(1964)的经典定理指出,对于每个正整数 $k$,图 $G$ 包含 $k$ 条两两顶点不相交的 $\mathcal{A}$-路径,或者一个大小不超过 $2(k-1)$ 的集合 $Z\subseteq V(G)$,使得 $G-Z$ 中没有 $\mathcal{A}$-路径。我们将其推广到诱导设置:我们证明图 $G$ 包含 $k$ 条两两反完备的 $\mathcal{A}$-路径,或者一个大小不超过 $78(k-1)$ 的集合 $Z$,使得在移除 $Z$ 的闭邻域后,所得图中没有 $\mathcal{A}$-路径。这里,两条路径是反完备的,如果它们顶点不相交且图中没有边连接它们的端点。我们进一步表明,如果移除 $Z$ 中每个顶点的半径为 4 的球体(而不是半径为 1 的球体),则 $Z$ 的大小上限可以从 $78(k-1)$ 降低到 $4(k-1)$,这接近最优解的因子 2。我们还建立了关于长诱导 $\mathcal{A}$-路径的类似结果。

英文摘要:

Given a graph $G$ and $\mathcal{A}\subseteq V(G)$, a classical theorem of Gallai (1964) states that for every positive integer $k$, the graph $G$ contains $k$ pairwise vertex-disjoint $\mathcal{A}$-paths, or a set $Z\subseteq V(G)$ of size at most $2(k-1)$ such that $G-Z$ contains no $\mathcal{A}$-paths. We generalise Gallai's theorem to the induced setting: We prove that $G$ contains $k$ pairwise anti-complete $\mathcal{A}$-paths, or a set $Z$ of size at most $54(k-1)$ such that, after removing the closed neighbourhood of $Z$, the resulting graph has no $\mathcal{A}$-path. Here, two paths are anti-complete if they are vertex disjoint and there is no edge in $G$ having one endpoint in each of them. We further show that the bound $54(k-1)$ on the size of $Z$ can be reduced to $4(k-1)$ if one removes the balls of radius $4$ around the vertices of $Z$ (instead of radius $1$), which is within a factor $2$ of optimal. We also establish analogous results for long induced $\mathcal{A}$-paths.

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

↑