BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/380
DTSTAMP:20230914T125922Z
SUMMARY:Constructive and Non-constructive Aspects of the Lovasz Local Lemma
DESCRIPTION:Speaker: Aravind Srinivasan (University of Maryland at College 
 Park\nDepartment of Computer Science\nRoom 3263\, A.V. Williams Building\n
 College Park\, MD 20742\nUnited States of America)\n\nAbstract: \nIn three
  talks\, I will describe aspects of the Local Lemma that have recently bee
 n uncovered by Moser & Tardos\, Pegden\, and David Harris and myself. As a
  running example\, we will consider the following type of "graph transvers
 al" problem introduced by Bollobas\, Erdos and Szemeredi in the 1970s: giv
 en a graph $G = (V\,E)$ and an integer $s$\, for how small a $b$ can we gu
 arantee that no matter how $V$ has been partitioned into blocks\, each of 
 size at least $b$\, there is a way of choosing one vertex from each block 
 such that the chosen vertices do not induce a clique on $s$ vertices?\n
URL:https://www.tcs.tifr.res.in/web/events/380
DTSTART;TZID=Asia/Kolkata:20130702T103000
DTEND;TZID=Asia/Kolkata:20130702T113000
LOCATION:AG-69
END:VEVENT
END:VCALENDAR