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.
Incorporating Weisfeiler-Leman into algorithms for group isomorphism
在本文中,我们结合了许多标准的和最近的代数技术测试同构的有限群(GPI)与组合技术,通常已被应用到图同构。特别地,我们展示了如何将用于特定组类的几种最先进的GpI算法组合成用于一般GpI的算法,即:2015; Luks,2015),递归可细化滤波器(Wilson,J. Group Theory,2013)和低亏格GpI(Brooksbank-Maglione-Wilson,J. Algebra,2017)。递归细化过滤器-一个泛化的子群系列-形成这个框架的骨架,我们完善我们的过滤器通过建立一个超图编码低属的concurents,然后我们应用超图的变体的k维Weisfeiler-Leman技术。我们的技术是足够灵活的,很容易将额外的超图不变量或额外的特征子群。