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:682e0b3fab86d
DTSTART;TZID=America/Toronto:20231123T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231123T150000
URL:/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-sepehr-hajebi
SUMMARY:Graphs and Matroids Seminar - Sepehr Hajebi
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Several Gyrafas-Sumner-type results for tree
 width\n\nSPEAKER:\n Sepehr Hajebi\n\nAFFILIATION:\n University of À¶Ý®ÊÓƵ
 \n\nLOCATION:\n MC 5417\n\nABSTRACT: For a graph parameter which goes unbo
 unded at both ends of a\nrobust sparsity spectrum\, one naturally asks if 
 it is bounded anywhere\nin the middle. This is modelled after a well-known
  conjecture of\nGyarfas and Sumner\, asking the above question for the chr
 omatic number\nas the parameter and the girth as the measure of sparsity. 
 We look\nthrough this lens at the treewidth as the parameter and present a
 \nnumber of recent results answering the corresponding question in\nvariou
 s settings. If time permits\, we’ll try to sketch a proof as\nwell as so
 me directions for future work.\n\nThis is joint work with Bogdan Alecu\, M
 aria Chudnovsky\, Sophie Spirkl\nand partly with Tara Abrishami.\n 
DTSTAMP:20250521T171959Z
END:VEVENT
END:VCALENDAR