BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/612
DTSTAMP:20230914T125931Z
SUMMARY:Independent Sets in Hypergraphs
DESCRIPTION:Speaker: Dhruv Mubayi (Uiversity of Illinois at Chicago\nDepart
 ment of Mathematics\, Statistics and Computer Science\n1200 W Harrison St.
 \nChicago\, Illinois 60607\nUnited States of America)\n\nAbstract: \nAbstr
 act: A basic problem in combinatorics is to determine the independence num
 ber of a hypergraph. We will consider this question in various contexts. O
 ur results show that the behavior of the independence number of sparse hyp
 ergraphs is quite different than the graph case. We will also describe som
 e hypergraph generalizations of the graph Ramsey number $R(3\,t)$. Our res
 ults address old questions and conjectures of Erdos-Hajnal (1972) and of A
 jtai-Erdos-Komlos-Szemeredi (1981).\n \n
URL:https://www.tcs.tifr.res.in/web/events/612
DTSTART;TZID=Asia/Kolkata:20150806T143000
DTEND;TZID=Asia/Kolkata:20150806T153000
LOCATION:AG-77
END:VEVENT
END:VCALENDAR