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:69ce855b610d8
DTSTART;TZID=America/Toronto:20231005T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231005T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-chinh-t-hoang
SUMMARY:Graphs and Matroids Seminar - Chinh T. Hoang
CLASS:PUBLIC
DESCRIPTION:TITLE: A closure lemma for tough graphs and Hamiltonian ideals\
 n\nSPEAKER:\n Chinh T. Hoang\n\nAFFILIATION:\n Wilfrid Laurier University\
 n\nLOCATION:\n MC 5417\n\nABSTRACT: The closure of a graph $G$ is the grap
 h $G^*$ obtained from\n$G$ by repeatedly adding edges between pairs of non
 -adjacent vertices\nwhose degree sum is at least $n$\, where $n$ is the nu
 mber of vertices\nof $G$. The well-known Closure Lemma proved by Bondy and
  Chv\\'atal\nstates that a graph $G$ is Hamiltonian if and only if its clo
 sure\n$G^*$ is. This lemma can be used to prove several classical results 
 in\nHamiltonian graph theory. We prove a version of the Closure Lemma for\
 ntough graphs.
DTSTAMP:20260402T150355Z
END:VEVENT
END:VCALENDAR