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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682e020e8dc0b
DTSTART;TZID=America/Toronto:20210426T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210426T113000
URL:/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-seminar-sabrina-lato-1
SUMMARY:Algebraic Graph Theory Seminar - Sabrina Lato
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: A Spectral Moore Bound for Bipartite Semire
 gular Graphs\n\nSpeaker:\n Sabrina Lato\n\nAffiliation:\n University of Wa
 terloo\n\nZoom:\n Contact Soffia Arnadottir\n\nABSTRACT:\n\nThe Moore boun
 d provides an upper bound on the number of vertices of a\nregular graph wi
 th a given degree and diameter\, though there are\ndisappointingly few gra
 phs that achieve this bound. Thus\, it is\ninteresting to ask what additio
 nal information can be used to give\nMoore-type bounds that are tight for 
 a larger number of graphs.\nCioaba\, Koolen\, Nozaki\, and Vermette consid
 ered regular graphs with a\ngiven second-largest eigenvalue\, and found an
  upper bound for such\ngraphs.\n 
DTSTAMP:20250521T164046Z
END:VEVENT
END:VCALENDAR