BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1270
DTSTAMP:20230914T125957Z
SUMMARY:The Moore Bound for Irregular Graphs
DESCRIPTION:Speaker: Shanthanu  Suresh Rai\n\nAbstract: \nWhat is the large
 st number of edges in a graph of order n and girth g? For d-regular graphs
 \, essentially the best known answer is provided by the Moore bound. This 
 result can be extended to cover irregular graphs as well.\n\nIn the talk\,
  we will look at what the Moore bound is and some problems related to Moor
 e graphs. Then we will try to generalize the Moore bound for irregular gra
 phs.\n\nPaper: https://link.springer.com/article/10.1007/s003730200002\n
URL:https://www.tcs.tifr.res.in/web/events/1270
DTSTART;TZID=Asia/Kolkata:20230203T160000
DTEND;TZID=Asia/Kolkata:20230203T170000
LOCATION:A201
END:VEVENT
END:VCALENDAR