Lethbridge Number Theory and Combinatorics Seminar: Chi Hoi Yip

Paley graphs connect many branches of mathematics, notably combinatorics and number theory. Inspired by the Erdős-Ko-Rado (EKR) theorem for Paley graphs of square order (first proved by Blokhuis) and recent development of the study of EKR-type results, we study the EKR property, the EKR-module property, and the strict-EKR property of pseudo-Paley graphs from unions of cyclotomic classes using a mixture of ideas from number theory, finite geometry, and combinatorics. In particular, we extend the EKR theorem for Paley graphs to several families of pseudo-Paley graphs and solve a problem proposed by Godsil and Meagher. The talk is based on joint work with Shamil Asgarli, Sergey Goryainov, and Huiqiu Lin.