On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties.

The k-dimensional Weisfeiler-Leman algorithm (\(k\text {-}\mathrm {WL}\)) is a fruitful approach to the Graph Isomorphism problem. \(2\text {-}\mathrm {WL}\) corresponds to the original algorithm suggested by Weisfeiler and Leman over 50 years ago. \(1\text {-}\mathrm {WL}\) is the classical color refinement routine. Indistinguishability by \(k\text {-}\mathrm {WL}\) is an equivalence relation on graphs that is of fundamental importance for isomorphism testing, descriptive complexity theory, and graph similarity testing which is also of some relevance in artificial intelligence. Focusing on dimensions \(k=1,2\), we investigate subgraph patterns whose counts are \(k\text {-}\mathrm {WL}\) invariant, and whose occurrence is \(k\text {-}\mathrm {WL}\) invariant. We achieve a complete description of all such patterns for dimension \(k=1\) and considerably extend the previous results known for \(k=2\).