BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/46
DTSTAMP:20230914T125908Z
SUMMARY:Turan's Graph Theorem
DESCRIPTION:Speaker: Ajesh Babu\nSchool of Technology and Computer Science\
 nTata Institute of Fundamental Research\nHomi Bhabha Road\n\nAbstract: \nC
 onsider the set of all n-vertex graphs that does not contain a k-clique. W
 hat is the maximum number of edges that any graph in this set have?\n
URL:https://www.tcs.tifr.res.in/web/events/46
DTSTART;VALUE=DATE:20091127
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR