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

禁导子图与K-Tarski定理

Forbidden Induced Subgraphs and the Łoś-Tarski Theorem

Yijia Chen, Joerg Flum

摘要:

设$\mathscr C$是一类在导出子图下闭的有限图和无限图。经典模型论中著名的K-Tarski定理表明,$\mathscr C$在一阶逻辑中可由语句$φ$定义当且仅当$\mathscr C$有一个有限的禁止导出有限子图集.它提供了一个强有力的工具,以禁止诱导有限子图的形式来刻画小顶点覆盖图、有界树深图、有界灌木深图等的非平凡性。此外,利用完备性定理,我们可以从$φ$中计算出相应的禁止导出子图。我们表明,这台机器失败的有限图。- 有一类有限图$\mathscr C$,它在FO中是可定义的,在导出子图下是闭的,但不存在有限的禁止导出子图集. - 即使我们只考虑有限图的类$\mathscr C$,它可以由一组有限的禁止导出子图来刻画,这样的刻画不能从定义了$\mathscr C$的FO-语句$φ$来计算,并且对于任何可计算函数$f$,刻画的大小不能由$f(|φ|)$来限定。除了它们在图论中的重要性之外,上述结果还显著地加强了任意结构的类似已知结果。

英文摘要:

Let $\mathscr C$ be a class of finite and infinite graphs that is closed under induced subgraphs. The well-known Łoś-Tarski Theorem from classical model theory implies that $\mathscr C$ is definable in first-order logic (FO) by a sentence $φ$ if and only if $\mathscr C$ has a finite set of forbidden induced finite subgraphs. It provides a powerful tool to show nontrivial characterizations of graphs of small vertex cover, of bounded tree-depth, of bounded shrub-depth, etc. in terms of forbidden induced finite subgraphs. Furthermore, by the Completeness Theorem, we can compute from $φ$ the corresponding forbidden induced subgraphs. We show that this machinery fails on finite graphs. - There is a class $\mathscr C$ of finite graphs which is definable in FO and closed under induced subgraphs but has no finite set of forbidden induced subgraphs. - Even if we only consider classes $\mathscr C$ of finite graphs which can be characterized by a finite set of forbidden induced subgraphs, such a characterization cannot be computed from an FO-sentence $φ$, which defines $\mathscr C$, and the size of the characterization cannot be bounded by $f(|φ|)$ for any computable function $f$. Besides their importance in graph theory, the above results also significantly strengthen similar known results for arbitrary structures.

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

↑