Papers
Topics
Authors
Recent
Search
2000 character limit reached

A large family of strongly regular graphs with small Weisfeiler-Leman dimension

Published 1 Dec 2023 in math.CO | (2312.00460v1)

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.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.