BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e3b03324a8f
DTSTART;TZID=America/Toronto:20230329T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230329T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-sabrina-lato
SUMMARY:Algebraic Graph Theory - Sabrina Lato
CLASS:PUBLIC
DESCRIPTION:TITLE: Distance-Regular and Distance-Biregular Graphs\n\nSpeake
 r:\n Sabrina Lato\n\nAffiliation:\n University of Waterloo\n\nLocation:\n 
 MC\n\nABSTRACT: For a given diameter _d_ and valency _k_\, what is the\nma
 ximum number of vertices a _k_-regular graph of diameter _d _can\nhave\, a
 nd what graphs meet that bound? Although there is a\nstraightforward count
 ing argument to bound the number of vertices\nusing the structural informa
 tion\, the problem of characterizing the\ngraphs that meet the bound turns
  out to be a problem in algebraic\ngraph theory\, and helps gives rise to 
 the notion of distance-regular\ngraphs.
DTSTAMP:20260418T162419Z
END:VEVENT
END:VCALENDAR