BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/805
DTSTAMP:20230914T125939Z
SUMMARY:On Shannon's Zero Error Capacity of a Graph
DESCRIPTION:Speaker: Gowtham Raghunath Kurri\n\nAbstract: \nSuppose we want
  to transmit messages across a noisy channel to a receiver. The maximum ra
 te of transmission such that the receiver may recover the original message
  without errors (i.e.\, zero error) is called zero error capacity of the c
 hannel. In this context\, a channel can be represented by a graph and Shan
 non(1956) computed the capacity of all graphs with five or fewer vertices 
 - with the single exception of C_5 (a cycle with 5 vertices). Later\, Lasz
 lo Lovasz (1979) solved this seemingly very difficult combinatorial proble
 m by showing that capacity of C_5 is \\sqrt(5) with an astonishingly simpl
 e argument. In this talk\, we will first develop the required background a
 nd discuss his proof.\n
URL:https://www.tcs.tifr.res.in/web/events/805
DTSTART;TZID=Asia/Kolkata:20170901T171500
DTEND;TZID=Asia/Kolkata:20170901T181500
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR