A large family of strongly regular graphs with small Weisfeiler-Leman dimension
Abstract
In 2002, D. Fon-Der-Flaass constructed a prolific family of strongly regular graphs. In this paper, we prove that for infinitely many natural numbers n, this family contains n(n2/3) strongly regular n-vertex graphs X with the same parameters, which satisfy the following condition: an isomorphism between X and any other graph can be verified by the 4-dimensional Weisfeiler-Leman algorithm.
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.