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:6830f7bb07636
DTSTART;TZID=America/Toronto:20210125T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210125T113000
URL:/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-seminar-chris-godsil-34
SUMMARY:Algebraic Graph Theory Seminar - Chris Godsil
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: The Matchings Polynomial\n\nSpeaker:\n Chri
 s Godsil\n\nAffiliation:\n University of À¶Ý®ÊÓƵ\n\nZoom:\n Contact Soffi
 a Arnadottir\n\nABSTRACT:\n\nA $k$-matching in a graph is a matching of si
 ze $k$\, and $p(X\,k)$\ndenotes the number of $k$-matchings in $X$.\n\nThe
  matching polynomial of a graph is a form of generating function\nfor the 
 sequence $(p(X\,k))_{k\\ge0}$.\n\nIf is closely related to the characteris
 tic polynomial of a graph. I\nwill discuss some of the many interesting pr
 operties of this\npolynomial\, and some of the related open problems.\n 
DTSTAMP:20250523T223331Z
END:VEVENT
END:VCALENDAR