arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.02892cs.CCmath.CO
收藏

小色类图的Weisfeiler-Leman可识别性

Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm

Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky

摘要:

众所周知,色重数不超过3的顶点着色图的同构问题可以用经典的二维Weisfeiler-Leman算法(2-WL)来解决。另一方面,著名的Cai-Fürer-Immerman构造表明,即使是多维版本的算法也不足以处理色重数为4的图。我们给出了一个有效的决策过程,给定一个图$G$的颜色重4,识别是否$G$是可识别的2-WL,即,是否2-WL区分$G$从任何非同构图。事实上,我们解决了更普遍的问题,即识别最大纤维尺寸为4的给定相干构型是否是可分离的。这将我们的识别算法扩展到具有定向和着色边缘的颜色多重性4的图。我们的决策过程是基于显式描述的类图的颜色多重性4是不可识别的2-WL。颜色重数为4的Cai-Fürer-Immerman图在这里明显地作为一个自然子类出现,这表明Cai-Fürer-Immerman结构不是特别的。我们的分类也揭示了其他类型的图是很难为2-WL。其中之一是由入射几何中称为$(n_3)$ -构型的图案引起的。

英文摘要:

As it is well known, the isomorphism problem for vertex-colored graphs with color multiplicity at most 3 is solvable by the classical 2-dimensional Weisfeiler-Leman algorithm (2-WL). On the other hand, the prominent Cai-Fürer-Immerman construction shows that even the multidimensional version of the algorithm does not suffice for graphs with color multiplicity 4. We give an efficient decision procedure that, given a graph $G$ of color multiplicity 4, recognizes whether or not $G$ is identifiable by 2-WL, that is, whether or not 2-WL distinguishes $G$ from any non-isomorphic graph. In fact, we solve the much more general problem of recognizing whether or not a given coherent configuration of maximum fiber size 4 is separable. This extends our recognition algorithm to graphs of color multiplicity 4 with directed and colored edges. Our decision procedure is based on an explicit description of the class of graphs with color multiplicity 4 that are not identifiable by 2-WL. The Cai-Fürer-Immerman graphs of color multiplicity 4 distinctly appear here as a natural subclass, which demonstrates that the Cai-Fürer-Immerman construction is not ad hoc. Our classification reveals also other types of graphs that are hard for 2-WL. One of them arises from patterns known as $(n_3)$-configurations in incidence geometry.

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

↑