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:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0a5dbf2d8a
DTSTART;TZID=America/Toronto:20231123T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231123T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-sepehr-hajebi
SUMMARY:Graphs and Matroids Seminar - Sepehr Hajebi
CLASS:PUBLIC
DESCRIPTION:TITLE: Several Gyrafas-Sumner-type results for treewidth\n\nSPE
 AKER:\n Sepehr Hajebi\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION
 :\n MC 5417\n\nABSTRACT: For a graph parameter which goes unbounded at bot
 h ends of a\nrobust sparsity spectrum\, one naturally asks if it is bounde
 d anywhere\nin the middle. This is modelled after a well-known conjecture 
 of\nGyarfas and Sumner\, asking the above question for the chromatic numbe
 r\nas the parameter and the girth as the measure of sparsity. We look\nthr
 ough this lens at the treewidth as the parameter and present a\nnumber of 
 recent results answering the corresponding question in\nvarious settings. 
 If time permits\, we’ll try to sketch a proof as\nwell as some direction
 s for future work.\n\nThis is joint work with Bogdan Alecu\, Maria Chudnov
 sky\, Sophie Spirkl\nand partly with Tara Abrishami.
DTSTAMP:20260404T054708Z
END:VEVENT
END:VCALENDAR