- Series
- Other Talks
- Time
- Saturday, October 24, 2009 - 3:10pm for 1.5 hours (actually 80 minutes)
- Location
- LeCraw Auditorium
- Speaker
- Noga Alon – Mathematics and Computer Science, Tel Aviv University
- Organizer
- Robin Thomas
The spectral properties of a graph are intimately related to its structure. This can be applied in the study of discrete isoperimetric problems and in the investigation of extremal and algorithmic questions for graphs. I will discuss several recent examples illustrating this theme.