About the seminar
Students pick topics from a predetermined list of topics to present in class. The choice of whether to give a board talk or prepare slides is up to the students.
Course Lecturer: Elad Aigner-Horev
How to enlist for a talk:
Email the lecturer; FIFO policy
A student must be preset in at least 11 out of 13 sessions
First lecture: Reserved for logistics and explanations about the seminar. No talks during the first lecture.
About the Grade:
- 100% presentation
- Grade starts at 80 always (for reasonable presentations)
- Reasonable := will be explained in the first lecture
- Bonus system:
- If a talk is assigned x pts as bonus this means that the minimal grade for this presentation is 80+x (again subject to the definition of reasonable)
The seminar mainly focuses on the following two books (there are exceptions though)
 The probabilistic method by Noga Alon and Joel Spencer.
 Extremal combinatorics with applications in computer science by Stasys Jukna.