Solymosi József: On the clique number of the Paley graph

In this talk we follow a nice argument of Hanson and Petridis to show that the clique number of the Paley graph in $F_p$ is at most $\sqrt{p/2}+1$. This is a good illustration of Stepanov’s method. If time permits we will see further examples to the method.