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:69d1658dcc32a
DTSTART;TZID=America/Toronto:20200611T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200611T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-co
 mbinatorics-seminar-steve-melczer-0
SUMMARY:Algebraic Combinatorics Seminar - Steve Melczer
CLASS:PUBLIC
DESCRIPTION:TITLE: An Upper Bound on Graphical Partitions\n\nSpeaker:\n St
 eve Melczer\n\nAffiliation:\n UQAM/CRM\n\nZoom\n Contact Karen Yeats\n\nAB
 STRACT:\n\nAn integer partition is called graphical if it can be realized 
 as the\nsize-ordered degree sequence of a simple graph (with no loops or\n
 multiple edges).  In his 1736 paper on the Königsberg bridge\nproblem\, 
 arguably the origin of graph theory\, Euler gave a necessary\ncondition fo
 r a partition to be graphical: its sum must be even.
DTSTAMP:20260404T192501Z
END:VEVENT
END:VCALENDAR