On the Clique Number of a Strongly Regular Graph

Gary R. W. Greaves, Leonard H. Soicher


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.


Delsarte bound, Hoffman bound, Block intersection polynomial, Clique number, Conference graphs, Strongly regular graphs, Clique adjacency bound

Full Text: