Expander graphs in combinatorics and computer science
MAT.740UF / 505.021
J. Erde, Institute of Discrete Mathematics
Winter term 2021/22
The course takes place Tuesdays, 10:30-12:15 in the seminar room A206, and Thursdays, 16:15-18:00 in the seminar room AE02, Steyrergasse 30. The lecture on 20.01.2022 will take place at a non-standard time, to be determined later.
The course will consist of twenty lectures and six exercise sessions.
Oral exams will be given at the end of the course. The dates for the exams will be arranged later.
The course will roughly follow the survey paper Expander graphs and their applications of Hoory, Linial and Wigderson. A rough version of the lecture notes can be found here, please note these are not intended for wider distribution.
The exercise sheets will be available about a week before the respective exercise session. A list will be made available at the start of each exercise class for you to mark the exercises you have completed. The choice of who shall present which solution in class will be made randomly. Students will recieve marks according to the amount of exercises completed, with only the best 5 out of 6 weeks counting towards the total. In addition, students will recieve up to 10 additional marks according to the quality of their presented solutions. Grades will then be assigned as follows:
| < | 50% | - nicht genügend (5), | |||
| 50 - | 60% | - - genügend (4), | |||
| 60 - | 70% | - befriedigend (3), | |||
| 70 - | 80% | - gut (2), | |||
| ≥ | 80% | |
- sehr gut (1). |