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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e5110bbb163
DTSTART;TZID=America/Toronto:20230206T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230206T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/hitting-all-
 maximum-stable-sets-p5-free-graphs-sepehr-hajebi
SUMMARY:Hitting all maximum stable sets in P5-free graphs - Sepehr Hajebi
CLASS:PUBLIC
DESCRIPTION:TITLE: Hitting all maximum stable sets in P5-free graphs\n\nSp
 eaker:\n Sepehr Hajebi\n\nInstitution:\n University of Waterloo\n\nLocatio
 n:\n MC 5479\n\nABSTRACT: We prove that there exists a function f such th
 at\, for\nevery positive integer c\, every graph with no induced five-vert
 ex path\ncontains either a clique on c+1 vertices or a set of at most f(c)
 \nvertices which intersects all maximum stable sets in G.
DTSTAMP:20260419T172947Z
END:VEVENT
END:VCALENDAR