Vol. 9, No. 3, 2020
Download this article
Download this article For screen
For printing
Recent Issues
Volume 11, Issue 4
Volume 11, Issue 3
Volume 11, Issue 2
Volume 11, Issue 1
Volume 10, Issue 4
Volume 10, Issue 3
Volume 10, Issue 2
Volume 10, Issue 1
Volume 9, Issue 4
Volume 9, Issue 3
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 4
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
Older Issues
Volume 7, Issue 4
Volume 7, Issue 3
Volume 7, Issue 2
Volume 7, Issue 1
Volume 6, Issue 4
Volume 6, Issue 2-3
Volume 6, Issue 1
Volume 5, Issue 4
Volume 5, Issue 3
Volume 5, Issue 1-2
Volume 4, Issue 4
Volume 4, Issue 3
Volume 4, Issue 2
Volume 4, Issue 1
Volume 3, Issue 3-4
Volume 3, Issue 2
Volume 3, Issue 1
Volume 2, Issue 4
Volume 2, Issue 3
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 4
Volume 1, Issue 3
Volume 1, Issue 2
Volume 1, Issue 1
The Journal
About the Journal
Editorial Board
Subscriptions
 
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
 
founded and published with the
scientific support and advice of
mathematicians from the
Moscow Institute of
Physics and Technology
 
ISSN (electronic): 2640-7361
ISSN (print): 2220-5438
Author Index
To Appear
 
Other MSP Journals
This article is available for purchase or by subscription. See below.
Generalizations of $k$-dimensional Weisfeiler–Leman stabilization

Anuj Dawar and Danny Vagnozzi
Vol. 9 (2020), No. 3, 229–252
DOI: 10.2140/moscow.2020.9.229
Abstract

The family of Weisfeiler–Leman equivalences on graphs is a widely studied approximation of graph isomorphism with many different characterizations. We study these and other approximations of isomorphism defined in terms of refinement operators and Schurian polynomial approximation schemes (SPAS). The general framework of SPAS allows us to study a number of parameters of the refinement operators based on Weisfeiler–Leman refinement, logic with counting, lifts of Weisfeiler–Leman as defined by Evdokimov and Ponomarenko, the invertible map test introduced by Dawar and Holm, and variations of these, as well as to establish relationships between them.

PDF Access Denied

We have not been able to recognize your IP address 3.236.207.90 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recom­mendation form. Or, visit our subscription page for instructions on purchasing a subscription.

You may also contact us at contact@msp.org
or by using our contact form.

Or, you may purchase this single article for USD 40.00:

Keywords
Weisfeiler–Leman, combinatorics, invertible map, graph isomorphism, complexity theory, coherent configuration
Mathematical Subject Classification 2010
Primary: 05E15, 05E30, 05E99
Secondary: 03D15
Milestones
Received: 3 August 2019
Revised: 14 May 2020
Accepted: 29 May 2020
Published: 15 October 2020
Authors
Anuj Dawar
Department of Computer Science and Technology
University of Cambridge
Cambridge
United Kingdom
Danny Vagnozzi
Department of Computer Science and Technology
University of Cambridge
Cambridge
United Kingdom