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:682e541e89b93
DTSTART;TZID=America/Toronto:20200618T130300
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200618T130300
URL:/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-julian-romero
SUMMARY:Combinatorial Optimization Reading Group - Julián Romero
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Graph coloring of graphs with large girth i
 s hard for the\nNullstellensatz\n\nSpeaker:\n Julián Romero\n\nAffiliatio
 n:\n University of À¶Ý®ÊÓƵ\n\nZoom:\n Contact Sharat Ibrahimpur\n\nABSTRA
 CT:\n\nIn this talk we will discuss a method to solve combinatorial proble
 ms\nusing hierarchies of systems of linear equations using Hilbert's\nNull
 stellensatz. In particular\, we will study the behaviour of these\nhierarc
 hies for deciding the non-$k$-colorabilty of graphs.\n 
DTSTAMP:20250521T223054Z
END:VEVENT
END:VCALENDAR