BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION:  Schedule:       Introduction: Mon Oct 25 14:15-15:15    Lectu
 re 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 gener
 alization of the method of alternating paths\, this technique was introduce
 d by Tashkinov to address questions such as the Goldberg-Seymour problem. I
 n 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 r
 esults for multigraph edge colouring for which it has been used. Moreover\,
  these applications typically come with efficient algorithms\, since the pr
 oof of Tashkinov's Theorem is algorithmic. All are welcome to attend. No pr
 ior knowledge of edge colouring will be assumed.    Detailed description of
  the program .   *Lectures from Tuesday to Friday will take place at: Arnim
 alle 6.   If you are planning to participate\, please send a note to:  i.br
 unke@fu-berlin.de  . 
DTEND:20211029T120000
DTSTAMP:20211109T200000
DTSTART:20211025T141500
CLASS:PUBLIC
LOCATION:Introduction: Mon Oct 25 14:15-15:15\n     Lecture 1: Tues Oct 26 
 14:15-15:45 - Room 025/026*\n     Lecture 2: Thurs Oct 28 8:30-10:00 - Room
  032*\n     Lecture 3: Thurs Oct 28 10:30-12:00 - Room 025/026*\n     Lectu
 re 4: Fri Oct 29 10:15-11:45 - Room 007/008*\n \n Lectures 1-4 will take pl
 ace at Arnimallee 6.\n 
SEQUENCE:0
SUMMARY:Mini Course: &quot\;Edge colouring of multigraphs and the Tashkinov
  trees method&quot\;
UID:120460198@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/events/2021-10-Mini-C
 ourse-Haxell.html
END:VEVENT
END:VCALENDAR