The asymptotics of strongly regular graphs
Combinatorics
2007-05-23 v1
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.
Cite
@article{arxiv.math/0403450,
title = {The asymptotics of strongly regular graphs},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0403450},
year = {2007}
}