arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.12082math.COmath.LO
收藏

泛型无三角形圆图

The Generic Circular Triangle-Free Graph

Manuel Bodirsky, Santiago Guzmán-Pro

AI总结:

本文引入泛型无三角形圆图$\boldsymbol{\rm C_3}$并公理化其一阶理论,刻画了可嵌入该图的可数图类,关联圆色数小于3的判定问题,证明其为NP完全,同时重证了相关经典结论。

摘要:

本文引入泛型无三角形圆图$\boldsymbol{\rm C_3}$,并提出其一阶理论的有限公理化方案。核心结果表明,可数图$G$可嵌入$\boldsymbol{\rm C_3}$当且仅当它是不含$\boldsymbol{\rm {K_3, K_1 + 2K_2, K_1+C_5, C_6}}$的图。作为该结果的副产物,我们得到了有限不含$\boldsymbol{\rm {K_3, K_1 + 2K_2, K_1+C_5, C_6}}$图的几何刻画,以及独立数严格小于3的单位Helly圆弧图的最小障碍的(有限)列表。\n圆色数$\boldsymbol{\rm χ_c(G)}$是经典色数$\boldsymbol{\rm χ(G)}$的精细化。我们构造$\boldsymbol{\rm C_3}$,使得图$G$的圆色数严格小于3当且仅当$G$可同态映射到$\boldsymbol{\rm C_3}$。基于核心结果,我们证明$\boldsymbol{\rm χ_c(G) < 3}$当且仅当$G$可扩展为不含$\boldsymbol{\rm {K_3, K_1 + 2K_2, K_1+C_5, C_6}}$的图,进而利用该结果重新证明了Brandt(1999年)提出的关于$\boldsymbol{\rm χ_c(G) < 3}$的经典刻画。最后,我们解答了Guzmán-Pro、Hell和Hernández-Cruz近期提出的问题,证明判定给定有限图$G$是否满足$\boldsymbol{\rm χ_c(G) < 3}$的问题是NP完全的。

英文摘要:

In this paper, we introduce the generic circular triangle-free graph $\mathbb C_3$ and propose a finite axiomatization of its first order theory. In particular, our main results show that a countable graph $G$ embeds into $\mathbb C_3$ if and only if it is a $\{K_3, K_1 + 2K_2, K_1+C_5, C_6\}$-free graph. As a byproduct of this result, we obtain a geometric characterization of finite $\{K_3, K_1 + 2K_2, K_1+C_5, C_6\}$-free graphs, and the (finite) list of minimal obstructions of unit Helly circular-arc graphs with independence number strictly less than three. The circular chromatic number $χ_c(G)$ is a refinement of the classical chromatic number $χ(G)$. We construct $\mathbb C_3$ so that a graph $G$ has circular chromatic number strictly less than three if and only if $G$ maps homomorphically to $\mathbb C_3$. We build on our main results to show that $χ_c(G) < 3$ if and only if $G$ can be extended to a $\{K_3, K_1 + 2K_2, K_1+C_5, C_6\}$-free graph, and in turn, we use this result to reprove an old characterization of $χ_c(G) < 3$ due to Brandt (1999). Finally, we answer a question recently asked by Guzmán-Pro, Hell, and Hernández-Cruz by showing that the problem of deciding for a given finite graph $G$ whether $χ_c(G) < 3$ is NP-complete.

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

↑