PIMS-UVic Discrete Math Seminar: Kyle Yip

Let q=1 mod 4 be a prime power and let F_q be the finite field of q elements. The Paley graph of order q is the graph with vertex set F_q, such that two vertices are adjacent if and only if their difference is a square in F_q. Paley graphs play an important role in many branches of combinatorics and number theory. Among many exciting questions related to Paley graphs, estimating their clique number is of importance. In this talk, I will report recent progress on the lower bounds and upper bounds on the clique number of Paley graphs and Paley-like graphs. Joint work with Seoyoung Kim, Jozsef Solymosi, and Semin Yoo.