Schedule:

• Introduction: Mon Oct 25 14:15-15:15
• Lecture 1:      Tues Oct 26 14:15-15:45 - Room 025/026*
• Lecture 2:      Thurs Oct 28 8:30-10:00 - Room 032*
• Lecture 3:      Thurs Oct 28 10:30-12:00 - Room 025/026*
• Lecture 4:      Fri Oct 29 10:15-11:45 - Room 007/008*.

Program:

In this course we will study edge colouring in multigraphs, with an emphasis on the method of Tashkinov trees.
A sophisticated generalization of the method of alternating paths, this technique was introduced by Tashkinov to address questions such as the Goldberg-Seymour problem. In particular we will see the theorem of Tashkinov that forms the foundation of the method, and how to apply it to obtain some of the many important results for multigraph edge colouring for which it has been used. Moreover, these applications typically come with efficient algorithms, since the proof of Tashkinov's Theorem is algorithmic.
All are welcome to attend. No prior knowledge of edge colouring will be assumed.

Detailed description of the program.

*Lectures from Tuesday to Friday will take place at: Arnimalle 6.

If you are planning to participate, please send a note to: i.brunke@fu-berlin.de .