A well-known conjecture of Babai states that if G is any finite simple group and X is a generating set of G, then the diameter of the Cayley graph Cay(G, X) is bounded by a polylogarithmic function of |G|. The goal of the talk is to sketch a proof of such a bound in the case that X contains a transvection.
This video is part of the Webinar in Additive Combinatorics series, and this is their YouTube channel.
