BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: The technique of Tashkinov trees is an important tool that has
  been used to obtain many significant results on edge colouring of multigra
 phs. We describe the method and its main motivation\, the famous Goldberg-S
 eymour conjecture from the 1970's. We also outline several results from the
  last decade that have used the Tashkinov trees technique.   This talk is i
 ntended as an  introduction \, overview and survey to accompany the upcomin
 g short course  "Edge colouring of multigraphs and the Tashkinov trees meth
 od" (Oct 26-29) . 
DTSTAMP:20211017T221800
DTSTART:20211025T141500
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9 
 \n 14195 Berlin \n Room 005 (Ground Floor)
SEQUENCE:0
SUMMARY:Penny Haxell (University of Waterloo): Tashkinov trees - This talk 
 is also introduction to upcoming mini course &quot\;Edge colouring of multi
 graphs&quot\; Oct. 26-29
UID:107919273@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20211025-L-Hax
 ell.html
END:VEVENT
END:VCALENDAR