**Date & Time:** Thursday, November 07, 2013, 13:50- 14:50.

**Venue:** Ramanujan Hall

**Title:** Expanders: Constructions and Applications - III

**Speaker:** Srikanth Srinivasan, IIT Bombay

**Abstract:** Graphs with few edges that are nevertheless extremely
well-connected are called Expander graphs. In the past few decades, expanders
have found various uses in many areas of combinatorics and theoretical
computer science. We survey some brief results on graph expansion, some
constructions of expanders (old and new), and time permitting, some applications.

References:

1. A monograph by Shlomo Hoory, Nati Linial, and Avi Wigderson:
www.cs.huji.ac.il/~nati/PAPERS/expander_survey.pdf

2. A course given by Prahladh Harsha on expanders:
http://www.tcs.tifr.res.in/~prahladh/teaching/05spring/