2000 character limit reached
A large family of strongly regular graphs with small Weisfeiler-Leman dimension (2312.00460v1)
Published 1 Dec 2023 in math.CO
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{\Omega(n{2/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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
