Events by date

Title: Maximal cliques in strongly regular graphs

Speaker: Gary Greaves Affiliation: Nanyang Technological University Zoom: Please contact Sabrina Lato for zoom link

Abstract: In this talk, I will introduce a cubic polynomial that can be associated to a strongly regular graph Γ. The roots of this polynomial give rise to upper and lower bounds for the size of a maximal clique in Γ. I will explain how we can use this cubic polynomial to rule out the existence of strongly regular graphs that correspond to an infinite family of otherwise feasible parameters. This talk is based on joint work with Jack Koolen and Jongyook Park.