A lower bound for the Weisfeiler-Leman dimension of circulant graphs
Abstract
It is proved that for infinitely many positive integers n, there exists a circulant graph of order n whose Weisfeiler-Leman dimension is at least clog n for some positive constant c not depending on n.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.