The asymptotics of strongly regular graphs
classification
🧮 math.CO
keywords
regularstronglygraphsasymptoticscalledchungcliquescomplement
read the original abstract
A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.