Events items teaser

Algebraic Graph Theory Seminar - Ferdinand Ihringer
2020-10-26 11:30 (America/Toronto)
TITLE: Pseuodrandom Cliquefree Graphs, Finite Geometry, and Spectra

Speaker:
Ferdinand Ihringer

Affiliation:
Ghent University, Belgium

Zoom:
Contact Soffia Arnadottir

ABSTRACT:

A regular graph is called optimally pseudorandom if its second largest
eigenvalue in absolute value is, up to a constant factor, as small as
possible. Determining the largest degree of an optimally pseudorandom
graph without a clique of size s is a well-known open problem in
extremal graph theory.
