Finite Geometries and pseudorandom graphs

Seminar/Forum

Finite Geometries and pseudorandom graphs

Room 107
Peter Hall
Monash Road

Map

More information

binzhoux@unimelb.edu.au

A construction of Alon and Krivelevich gives highly pseudorandom $K_k$-free graphs on $n$ vertices with edge density equal to $\Theta(n^{-1/(k -2)})$. Inspired by that, we explore the constructions of dense clique free pseudorandom graphs using finite polar spaces and we improve Alon and Krivelevich bound. This is joint work with Anurag Bishnoi and Ferdinand Ihringer.