arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.05883math.CO
收藏

一个粗 Erdős-Pósa 定理

A coarse Erdős-Pósa theorem

Jungho Ahn, J. Pascal Gollin, Tony Huynh, O-joung Kwon

AI总结:

本文将 Erdős-Pósa 定理推广到诱导环堆积,给出带长度阈值的结构性二分解与多项式算法,并推出受限图类的树独立数界。

摘要:

图中的诱导环堆积是指一组顶点互不相交的环,并且这些环之间没有边。我们将经典的 Erdős-Pósa 定理推广到诱导环堆积。更具体地说,我们证明存在函数 f(k,ℓ)=O(ℓk log k) 和 g(k)=O(k log k),使得对于所有整数 k≥1 和 ℓ≥3,每个图 G 都包含以下二者之一:一个由 k 个长度至少为 ℓ 的环组成的诱导环堆积,这些环不一定是诱导环;或者两个顶点集合 X_1 和 X_2,满足 |X_1|≤f(k,ℓ) 且 |X_2|≤g(k),并且在移除 X_1 的闭邻域,或移除 X_2 周围半径为 ℓ 的球之后,所得图在 G 中不含长度至少为 ℓ 的环。我们的证明是构造性的,并给出一种多项式时间算法;当 ℓ 为常数时,该算法可以找到诱导环堆积,或者找到集合 X_1 和 X_2。此外,我们证明,对于每个正整数 d,如果图 G 不包含两个距离大于 d 的环,那么 G 包含顶点集合 X_1 和 X_2,满足 |X_1|≤12(d+1) 且 |X_2|≤12,使得在移除 X_1 周围半径为 2d 的球,或移除 X_2 周围半径为 3d 的球之后,所得图都是森林。作为推论,我们证明,每个不含 K_{1,t} 诱导子图且不含由 k 个长度至少为 ℓ 的环组成的诱导环堆积的图,其树独立数至多为 O(tℓk log k),并且当 ℓ 为常数时,可以在多项式时间内构造相应的树分解。这解决了 Dallard 等人(arXiv:2402.11222)的一个猜想的特殊情形,并意味着在此类图上,许多 NP 难问题可以在多项式时间内求解。另一方面,我们表明,所有不含 K_{1,3} 诱导子图且不含两个距离大于 2 的环的图所构成的图类,具有无界的树独立数。

英文摘要:

An induced packing of cycles in a graph is a set of vertex-disjoint cycles with no edges between them. We generalise the classic Erdős-Pósa theorem to induced packings of cycles. More specifically, we show that there exist functions $f(k,\ell)=\mathcal{O}(\ell k\log k)$ and $g(k)=\mathcal{O}(k\log k)$ such that for all integers $k\geq1$ and $\ell\geq3$, every graph $G$ contains either an induced packing of $k$ cycles of length at least $\ell$, not necessarily induced cycles, or sets $X_1$ and $X_2$ of vertices with $|X_1|\leq f(k,\ell)$ and $|X_2|\leq g(k)$ such that, after removing the closed neighbourhood of $X_1$ or the ball of radius $\ell$ around $X_2$, the resulting graph has no cycle of length at least $\ell$ in $G$. Our proof is constructive and yields a polynomial-time algorithm finding either the induced packing or the sets $X_1$ and $X_2$ when $\ell$ is a constant. Furthermore, we show that for every positive integer $d$, if a graph $G$ does not contain two cycles at distance more than $d$, then $G$ contains sets $X_1$ and $X_2$ of vertices with $|X_1|\leq12(d+1)$ and $|X_2|\leq12$ such that, after removing the ball of radius $2d$ around $X_1$ or the ball of radius $3d$ around $X_2$, the resulting graphs are forests. As a corollary, we prove that every graph with no $K_{1,t}$ induced subgraph and no induced packing of $k$ cycles of length at least $\ell$ has tree-independence number at most $\mathcal{O}(t\ell k\log k)$, and one can construct a corresponding tree-decomposition in polynomial time when $\ell$ is a constant. This resolves a special case of a conjecture of Dallard et al. (arXiv:2402.11222), and implies that on such graphs, many NP-hard problems, are solvable in polynomial time. On the other hand, we show that the class of all graphs with no $K_{1,3}$ induced subgraph and no two cycles at distance more than $2$ has unbounded tree-independence number.

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

↑