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.
Divisor graph of complement of Gamma(R)
The asymptotics of $r(4,t)$
Asymptotics of entries of products of nonnegative 2-by-2 matrices
![QR code for arXiv:math/0403450 [math.CO]](http://oss.arxitics.com/images/favicon.svg)