An Upper Bound on the Weisfeiler-Leman Dimension

Thomas Schneider, Pascal Schweitzer

The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory a…