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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:683242a9d8411
DTSTART;TZID=America/Toronto:20200806T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200806T143000
URL:/combinatorics-and-optimization/events/algebraic-co
 mbinatorics-seminar-olha-silina
SUMMARY:Algebraic Combinatorics Seminar - Olha Silina
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Abelian covering graphs and their propertie
 s\n\nSpeaker:\n Olha Silina\n\nAffiliation:\n University of À¶Ý®ÊÓƵ\n\nZo
 om:\n Contact Karen Yeats\n\nABSTRACT:\n\n A covering graph is a structur
 e obtained from a graph by\n‘replacing’ every vertex with a coclique o
 f size $r$. The main\nfocus of this talk is connections between (spectral)
  characteristic of\na cover and properties such as being walk- or distance
 - regular.\n 
DTSTAMP:20250524T220529Z
END:VEVENT
END:VCALENDAR