  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.
