Abstract

Expander graphs are highly connected yet sparse, playing a crucial role in various areas of mathematics and computer science. In particular, constructing explicit expander graphs, especially those with a small spectral gap, is a fundamental but challenging problem. In this talk, we present new explicit constructions of graphs with improved spectral gap estimates, refining a construction by Alon (2020).

 

Organizer: Shagnik Das (NTU)