arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.04006cs.LO
收藏

用于有界 twin-width 图的远端组合工具

Distal combinatorial tools for graphs of bounded twin-width

Wojciech Przybyszewski

AI总结:

本文证明有界 twin-width 图具有线性邻域复杂度,并通过组合方法证明其有序图类的边关系具有远端性,进而引入远端切割与正则性引理作为组合工具。

摘要:

我们研究由有界 twin-width 图中的邻域形成的集合系统。首先证明这类图具有线性邻域复杂度,这与此前关于有界扩张类和有界 clique-width 图的结果类似。接下来,我们将注意力转向源自模型论的 distality(远端性)和抽象胞腔分解概念。我们给出了一个直接的组合证明,表明在有界 twin-width 的有序图类中,边关系是 distal 的。这使我们能够应用 Distal cutting lemma(远端切割引理)和 Distal regularity lemma(远端正则性引理),从而为有界 twin-width 图获得强有力的组合工具。

英文摘要:

We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and of bounded clique-width. Next, we shift our attention to the notions of distality and abstract cell decomposition, which come from model theory. We give a direct combinatorial proof that the edge relation is distal in classes of ordered graphs of bounded twin-width. This allows us to apply Distal cutting lemma and Distal regularity lemma, so we obtain powerful combinatorial tools for graphs of bounded twin-width.

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

↑