Instructor Topics and References Seminar Schedule Grading and Requirements |
Instructor |
Assistants |
||
Tibor Szabó | Alexey Pokrovskiy | Shagnik Das | |
Arnimallee 3, Rm 211a | Arnimallee 3, Rm 207 | Arnimallee 3, Rm 205 | |
szabo at math dot fu-berlin dot de | apokrovskiy at zedat dot fu-berlin dot de | shagn | ik@mi.fu-ber lin.de|
838-75217 |
While (loosely) maintaining central themes of colouring and counting, this seminar will cover a wide variety of topics, providing a cross-section of active areas of research in combinatorics.
Below are a list of the talks that will be given, along with links to the source material. |
Topic |
Source material |
Supervisor |
||
The chromatic number of the Kneser graph | Matoušek; Greene; Bárány; Lovász | Tibor | ||
The tightness of the Local Lemma | Shearer | Tibor | ||
Bipartite Kneser graphs are Hamiltonian | Mütze-Su | Alexey | ||
Counting and packing Hamilton cycles | Ferber-Krivelevich-Sudakov | Alexey/Tibor | ||
Counting minimal separators | Gaspers-Mackenzie | Alexey | ||
Ordered Ramsey numbers | Conlon-Fox-Lee-Sudakov | Alexey/Tibor | ||
Ohba's conjecture on chromatic-choosable graphs | Noel-Reed-Wu | Shagnik/Tibor | ||
Counting maximal intersecting families | Nagy-Patkós | Shagnik | ||
Independent sets in regular graphs | Kahn; Zhao | Shagnik/Tibor |
Our seminar will meet on selected Thursdays in Arnimallee 3, SR 210, from 2:15 pm to 5:45 pm. Each meeting will consist of two talks.
Below is the schedule for our seminar. |
Date |
Speakers |
Title |
Abstract |
||
May 21 | Alexander Jandt Max Marcuse |
The chromatic number of the Kneser graph | T.B.A. | ||
May 28 | Giulia Codenotti Teetje Stark |
Ordered Ramsey numbers | T.B.A. | ||
June 4 | Simon Treu | The tightness of the Local Lemma | T.B.A. | ||
June 4 | Darius Wuttke | Bipartite Kneser graphs are Hamiltonian | T.B.A. | ||
June 11 | Jennifer Friedrich Svenja Horn |
Counting and packing Hamilton cycles | T.B.A. | ||
June 18 | Jan Corsten Ricardo Euler |
Independent sets in regular graphs | T.B.A. | ||
June 25 | Tomas Bayer | Counting maximal intersecting families | T.B.A. | ||
June 25 | Björn Jeschke | Counting minimal separators | T.B.A. | ||
July 2 | Milan Möllenberg Barbara Schulzke |
Ohba's conjecture on chromatic-choosable graphs | T.B.A. |
Requirements |
If you have a partner for a double talk on a single topic, you should work together closely to understand your paper(s) and plan the individual talks. Before the talks, you have to schedule at least two meetings with your adviser:
|
||
Grading |
You will be graded based on two criteria, both equally important:
|
||
Attendance and activity |
To earn credit for the seminar, you must attend 90% of the lectures and pepper your colleagues with questions demanding clearer explanations of anything you do not understand in their talks. The goal of the seminar is not to allow the speaker to repeat his or her rehearsed talk in a calm and quiet setting, but rather that we the audience learn and appreciate some nice new mathematics. Bear in mind that it is the speaker who is there to serve the audience, and not vice versa! |