arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.00951math.COcs.DS
收藏

粗略等价于树长的图参数

Graph parameters that are coarsely equivalent to tree-length

Feodor F. Dragan

AI总结:

本文为与tree-length粗略等价的图参数提供了更简捷且界限更优的证明,并扩展了该参数列表,包括基于bramble拦截和树嵌入畸变等新条件,同时引入了推广弦图属性的圈“桥接”属性。

摘要:

如果两个图参数对于每个图$G$都在彼此的常数因子范围内,则称它们是粗略等价的。最近,有几个图参数被证明与tree-length粗略等价。回顾一下,图$G$的树分解${\cal T}(G)$的长度是${\cal T}(G)$中包的最大直径,而$G$的tree-length是$G$所有树分解中该长度的最小值。我们为文献中已知的结果提供了更简单且有时具有更好界限的证明,并进一步扩展了与tree-length粗略等价的图参数列表。在其他新结果中,我们证明了图$G$的tree-length较小,当且仅当对于$G$的每个bramble ${\cal F}$(或连通子图的每个Helly族${\cal F}$,或路径的每个Helly族${\cal F}$),在$G$中存在一个半径较小的圆盘能够拦截${\cal F}$的所有成员。此外,图$G$的tree-length较小,当且仅当$G$能够以较小的加性畸变嵌入到一棵与$G$具有相同顶点集的无权树中(不涉及任何Steiner点)。另外,我们为圈引入了一种新的自然“桥接”属性,它推广了弦图中圈的一个已知属性,并证明它也粗略地定义了tree-length。

英文摘要:

Two graph parameters are said to be coarsely equivalent if they are within constant factors from each other for every graph $G$. Recently, several graph parameters were shown to be coarsely equivalent to tree-length. Recall that the length of a tree-decomposition ${\cal T}(G)$ of a graph $G$ is the largest diameter of a bag in ${\cal T}(G)$, and the tree-length of $G$ is the minimum of the length, over all tree-decompositions of $G$. We present simpler and sometimes with better bounds proofs for those known in literature results and further extend this list of graph parameters coarsely equivalent to tree-length. Among other new results, we show that the tree-length of a graph $G$ is small if and only if for every bramble ${\cal F}$ (or every Helly family of connected subgraphs ${\cal F}$, or every Helly family of paths ${\cal F}$) of $G$, there is a disk in $G$ with small radius that intercepts all members of ${\cal F}$. Furthermore, the tree-length of a graph $G$ is small if and only if $G$ can be embedded with a small additive distortion to an unweighted tree with the same vertex set as in $G$ (not involving any Steiner points). Additionally, we introduce a new natural "bridging`` property for cycles, which generalizes a known property of cycles in chordal graphs, and show that it also coarsely defines the tree-length.

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

↑