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:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d3ef2c90905
DTSTART;TZID=America/Toronto:20210125T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210125T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-seminar-chris-godsil-34
SUMMARY:Algebraic Graph Theory Seminar - Chris Godsil
CLASS:PUBLIC
DESCRIPTION:TITLE: The Matchings Polynomial\n\nSpeaker:\n Chris Godsil\n\n
 Affiliation:\n University of Waterloo\n\nZoom:\n Contact Soffia Arnadottir
 \n\nABSTRACT:\n\nA $k$-matching in a graph is a matching of size $k$\, and
  $p(X\,k)$\ndenotes the number of $k$-matchings in $X$.\n\nThe matching po
 lynomial of a graph is a form of generating function\nfor the sequence $(p
 (X\,k))_{k\\ge0}$.\n\nIf is closely related to the characteristic polynomi
 al of a graph. I\nwill discuss some of the many interesting properties of 
 this\npolynomial\, and some of the related open problems.
DTSTAMP:20260406T173644Z
END:VEVENT
END:VCALENDAR