BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20251121T075032EST-6049urjzRL@132.216.98.100
DTSTAMP:20251121T125032Z
DESCRIPTION:Entropy Compression and the Lovasz Local Lemma\n\n\n	The Lovasz 
 Local Lemma\, a cornerstone of the probabilistic method\, is a powerful an
 d widely used proof technique. In 2009\, Moser introduced a technique call
 ed entropy compression to provide efficient algorithms which construct obj
 ects that the Local Lemma guarantees to exist. Recently\, entropy compress
 ion has been used to develop more powerful versions of the Local Lemma whi
 ch provide existence proofs in settings where the original Local Lemma doe
 s not apply. I will illustrate this technique with applications to graph c
 olouring: (a) colouring triangle-free graphs\, and (b) frugal colouring\, 
 where no colour can appear too many times in any neighbourhood.\n
DTSTART:20170306T210000Z
DTEND:20170306T220000Z
LOCATION:room 1205\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue
  Sherbrooke Ouest
SUMMARY:Mike Molloy\, University of Toronto
URL:/mathstat/channels/event/mike-molloy-university-to
 ronto-266718
END:VEVENT
END:VCALENDAR