BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/44
DTSTAMP:20230914T125907Z
SUMMARY:Counting the Number of Spanning Trees in a Graph
DESCRIPTION:Speaker: Rakesh Venkat\nSchool of Technology and Computer Scien
 ce\nTata Institute of Fundamental Research\nHomi Bhabha Road\n\nAbstract: 
 \nA classic counting algorithm\, Kirchhoff's theorem gives a formula for f
 inding the number of spanning trees in a simple\, connected\, undirected g
 raph. I will discuss a simple proof of this theorem\, based on elementary 
 linear algebra.\n
URL:https://www.tcs.tifr.res.in/web/events/44
DTSTART;VALUE=DATE:20091113
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR