On the clique number of a strongly regular graph
Combinatorics
2019-01-31 v1
Abstract
We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including infinitely many parameter tuples that correspond to Paley graphs.
Keywords
Cite
@article{arxiv.1604.08299,
title = {On the clique number of a strongly regular graph},
author = {Gary R. W. Greaves and Leonard H. Soicher},
journal= {arXiv preprint arXiv:1604.08299},
year = {2019}
}
Comments
13 pages