Alexander Lubotzky
Published 2011-05-12Version 1
Expander graphs are highly connected sparse finite graphs. They play an important role in computer science as basic building blocks for network constructions, error correcting codes, algorithms and more. In recent years they have started to play an increasing role also in pure mathematics: number theory, group theory, geometry and more. This expository article describes their constructions and various applications in pure and applied mathematics.
Comments: This paper is based on notes prepared for the Colloquium Lectures at the Joint Annual Meeting of the American Mathematical Society (AMS) and the Mathematical Association of America (MAA). New Orleans, January 6-9, 2011
Strong blocking sets and minimal codes from expander graphs
On Unique Neighborhoods in Bipartite and Expander Graphs
A note on the structure of expanders
![QR code for arXiv:1105.2389 [math.CO]](http://oss.arxitics.com/images/favicon.svg)