BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/800
DTSTAMP:20230914T125938Z
SUMMARY:Method of Containers
DESCRIPTION:Speaker: Siddharth Bhandari\n\nAbstract: \nA recent powerful me
thod has been independently developed by Saxton and Thomason (2012) and by
Balogh\, Morris\, Samotij (2014). This method supplies a structural chara
cterisation of the independent sets in uniform hypergraphs satisfying cert
ain natural conditions\, by showing that in such hypergraphs every indepen
dent set is almost fully contained in one of a small number of sparse sets
(called containers). We shall see an application of the above method by S
axton and Thomason to prove the following result (Alon'00): list chromatic
number of any graph with average degree $d$ is $\\Omega(\\log d)$.\n \n
URL:https://www.tcs.tifr.res.in/web/events/800
DTSTART;TZID=Asia/Kolkata:20170811T171500
DTEND;TZID=Asia/Kolkata:20170811T181500
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR