BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/217
DTSTAMP:20230914T125915Z
SUMMARY:An Upper Bound on the Bisection Width of d-Regular Graphs
DESCRIPTION:Speaker: Devendra Desai\nRutgers University\nDepartment of Comp
 uter Science\n110 Frelinghuysen Road\nPiscataway\, NJ 08854-\n\nAbstract: 
 \nThe 'bisection width' of a graph is defined as the minumum number of edg
 es that need to be removed to partition the graph into two equal halves. I
 f the graph is 'sparse'\, then we don't expect this quantity to be large. 
 In this talk\, I will present a result of Noga Alon\, which gives an upper
  bound on the bisection width of any d-regular graph\, where the number of
  vertices is 'much more' than d. Time permitting\, I will also discuss som
 e other interesting cut problems and what we know about them.\n
URL:https://www.tcs.tifr.res.in/web/events/217
DTSTART;VALUE=DATE:20110812
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR