On the clique number of a strongly regular graph
  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. 
Gary R. W. Greaves and Leonard H. Soicher
math.CO