Upcoming Events
- The talks happen Wednesdays, 2-4 ct in Arnimallee 3-5/Hörsaal 001
- The first exercise is due Tuesday, 2pm - please submit your solution on Whiteboard
Schedule
|
Date | Name | Advisor | 1st Meeting Until | 2nd Meeting and Homework Suggestion Until |
---|---|---|---|---|---|
Talk 1 | Nov 6 | Silas Rathke | |||
Talk 2 | Nov 13 | Tibor Szabó | |||
Talk 3 | Nov 20 | Eren Bolkar | Yamaan Attwa | Nov 6 | Nov 13 |
Talk 4 | Nov 27 | Baixin Chen | Peter Martin | Nov 13 | Nov 20 |
Talk 5 | Dec 4 | Margrate Zepter | Silas Rathke | Nov 20 | Nov 27 |
Dec 11 |
Margrate Zepter |
||||
Talk 6 | Dec 18 | Csenge Urszuly | Silas Rathke | Dec 4 | Dec 11 |
Talk 8 | Jan 8 | Tibor Szabó | Tibor Szabó | Dec 11 | Dec 18 |
Talk 9 | Jan 15 | Erfan Shahrezai | Tibor Szabó | Dec 18 | Jan 8 |
Talk 10 | Jan 22 | Erfan Shahrezai | |||
Talk 11 | Jan 29 | Larion Garaczi | Tibor Szabó | Jan 8 | Jan 15 |
Feb 5 | Niall Smith | ||||
Feb 12 | Yamaan Attwa |
Rules
General: Plan your talk for 75 minutes and measure your time when you practice. If the material in your section is too large for 75 minutes, then select the most important part(s), so your audience gets the most out of your section(s). Plan what you would like to present, and in what order. Be optimistic in how it will go, but also think through what exactly you would cut if unforeseen circumstances (say too many questions) prevent you from finishing everything in 75 minutes. (What are the parts that should definitely be presented?)
There are a few very strict rules for giving a talk.
You have to schedule in time at least two preparatory meetings with your advisor. (can be more)
- The "Understanding meeting", at least two weeks before your talk. For this meeting, you should read the full text of the sections to be presented and made significant effort understanding every detail. (Remember that most of you will have to grasp definitions and statements from previous sections, in order to be able to understand your own section. Leave time for this as well!) Come with very concrete questions about what exact statement you do not understand and why. On the meeting these are discussed and by the end hopefully everything is clarified.
- The "Presentation meeting", at least one week before your talk. For this meeting, you should prepare the sequence of blackboard images for your full talk (what exactly will be written on the blackboard) and/or the sequence of all the slides (if you combine it with a computer presentation). On the meeting these are discussed and maybe changes are suggested.
- Suggest a "Homework Exercise", published on Whiteboard a week before your talk. This serves as a preparation for your audience before your talk. Maybe it is the proof of a lemma from your talk or the solution of some special cases from your talk or some well-suited other exercise which practices the definitions/concepts you will be talking about. One day before your talk you receive the submissions, you take a look at them and comment on them before returning it.
For the active participation credit you will also have to submit a solution to the Homework of your peers by the 2pm Tuesday, one day before the talk. (Submission is on Whiteboard). And, of course, you should be active in asking questions during the other talks. (Everybody will be grateful if you ask, there are no stupid questions!)
Contact
- Prof. Tibor Szabó: (szabo@zedat.fu-berlin.de)
- Silas Rathke (s.rathke@fu-berlin.de)
- Yamaan Attwa (attway97@zedat.fu-berlin.de)
- Peter Martin (petem99@zedat.fu-berlin.de)
The main focus of the seminar is Extremal Combinatorics, especially Ramsey- and Turán-type problems. These are beautiful topics and also serve as introduction towards the Discrete Mathematics III course in the Summer Semester.
Most of the topics will follow the book "Graph Theory and Additive Combinatorics" by Yufei Zhao. It can be downloaded here.
If you want to participate, check out the list of topics and write us an email about which topics you would prefer.
Prerequisites
- Bachelor level Analysis, Linear Algebra, Discrete Probability
- One introductory course in Combinatorics and Graph Theory (for example Discrete Mathematics I)