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:69d163f2b596b
DTSTART;TZID=America/Toronto:20200618T130300
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200618T130300
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-julian-romero
SUMMARY:Combinatorial Optimization Reading Group - Julián Romero
CLASS:PUBLIC
DESCRIPTION:TITLE: Graph coloring of graphs with large girth is hard for t
 he\nNullstellensatz\n\nSpeaker:\n Julián Romero\n\nAffiliation:\n Univers
 ity of Waterloo\n\nZoom:\n Contact Sharat Ibrahimpur\n\nABSTRACT:\n\nIn th
 is talk we will discuss a method to solve combinatorial problems\nusing hi
 erarchies of systems of linear equations using Hilbert's\nNullstellensatz.
  In particular\, we will study the behaviour of these\nhierarchies for dec
 iding the non-$k$-colorabilty of graphs.
DTSTAMP:20260404T191810Z
END:VEVENT
END:VCALENDAR