BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/23
DTSTAMP:20230914T125907Z
SUMMARY:Graphs\, Communication and Capacity
DESCRIPTION:Speaker: Kishor Barman\nSchool of Technology and Computer Scien
 ce\nTata Institute of Fundamental Research\nHomi Bhabha Road\n\nAbstract: 
 \nSuppose there is a graph G\, whose vertices are letters in an alphabet A
  and in which adjacency means that the letters can be confused in a transm
 ission. We would like to find the maximum number of messages which can be 
 sent without any danger of confusion (zero error). To this end\, we would 
 define the notion of 'capacity' of a graph. This has a strong connection t
 o the independent sets of certain graph powers. Although computing 'capaci
 ty' of a general graph is believed to be notoriously difficult\, capacity 
 of some special graphs are known. After introducing the problem\, we would
  compute the capacity of the 5-cycle\, as shown by Lovasz (The capacity of
  the  5-cycle was unknown until Lovasz found it in 1979\, that is more tha
 n 20 year after Shannon had posed the problem).\n\n(Note: Capacity is stil
 l unknown for all odd cycles of length more than 5. Check this out.)\n
URL:https://www.tcs.tifr.res.in/web/events/23
DTSTART;VALUE=DATE:20090819
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR