多维网格图的成对兼容表示
Pairwise Compatibility Representations of Multidimensional Grid Graphs
AI总结:
研究网格图在PCG模型及其扩展(多区间PCG和OR-PCG)下的表示,证明d维网格是(d-1)-区间-PCG和⌈d/2⌉-OR-PCG,并证明P_3□P_3□P_3不是PCG,从而解决三维网格图所需最小区间数的公开问题。
摘要:
成对兼容图(PCG)通过加权树中叶子到叶子距离的区间来表示图的邻接关系。我们在PCG模型及其两个自然扩展(多区间PCG和OR-PCG)下研究网格图。首先,我们证明每个$d$维网格图都是一个$(d-1)$-区间-PCG。该构造将网格分解为常数坐标和的超平面,并使用大基数编码,使得连续超平面之间的距离标识边的坐标方向。然后将一对邻近的代码值合并为一个区间,将区间数从$d$减少到$d-1$。其次,我们证明每个$d$维网格都是一个$\lceil d/2\rceil$-OR-PCG,通过将坐标方向成对分组;每个配对方向图是二维网格图的不交并,因此是PCG。最后,精确的树度量可满足性计算表明$P_3\square P_3\square P_3$不是PCG。因此,所有三维网格图所需的最小区间数恰好为二,解决了一个先前提出的开放问题。同样的障碍表明OR-PCG界在三维中是紧的,并意味着每个至少有三个因子且每个因子阶数至少为三的网格都不是PCG。
英文摘要:
Pairwise compatibility graphs (PCGs) represent graph adjacency by an interval of leaf-to-leaf distances in a weighted tree. We study grid graphs under the PCG model and two natural extensions: multi-interval PCGs and OR-PCGs. First, we prove that every $d$-dimensional grid graph is a $(d-1)$-interval-PCG. The construction decomposes the grid into hyperplanes of constant coordinate sum and uses a large-base encoding so that distances between consecutive hyperplanes identify the coordinate direction of an edge. A pair of nearby code values is then merged into one interval, reducing the number of intervals from $d$ to $d-1$. Second, we prove that every $d$-dimensional grid is a $\lceil d/2\rceil$-OR-PCG by grouping coordinate directions into pairs; each paired-direction graph is a disjoint union of two-dimensional grid graphs and is therefore a PCG. Finally, an exact tree-metric satisfiability computation shows that $P_3\square P_3\square P_3$ is not a PCG. Consequently, the minimum number of intervals sufficient for all three-dimensional grid graphs is exactly two, resolving a previously posed open problem. The same obstruction shows that the OR-PCG bound is tight in dimension three and implies that every grid with at least three factors of order at least three is not a PCG.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。