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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cfdcc4d7725
DTSTART;TZID=America/Toronto:20230320T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230320T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/closure-lemm
 a-tough-graphs-and-hamiltonian-degree-conditions
SUMMARY:A Closure Lemma for tough graphs and Hamiltonian degree conditions 
 -\nCléophée Robin
CLASS:PUBLIC
DESCRIPTION:TITLE : A Closure Lemma for tough graphs and Hamiltonian degre
 e\nconditions\n\nSpeaker:\n Cléophée Robin\n\nInstitution:\n Wilfrid Lau
 rier University \n\nLocation:\n MC 5479\n\nABSTRACT: A graph G is hamilt
 onian if it exists a cycle in G\ncontaining all vertices of G exactly onc
 e. A graph G is t-tough if\,\n\,for all subsets of vertices S\, the numb
 er of connected components in\nG − S is at most |S| / t.
DTSTAMP:20260403T152908Z
END:VEVENT
END:VCALENDAR