Parity lifts and bounded-treewidth witnesses for Weisfeiler–Leman equivalenceResearch Paper
The Weisfeiler–Leman (WL) method is the standard combinatorial heuristic for graph isomorphism: it repeatedly refines colors of -tuples of vertices, and two graphs it cannot tell apart are called -WL equivalent. It is equivalent to counting-logic indistinguishability and, by results of Dvořák (2010) and Dell, Grohe and Rattan (2018), to equality of…