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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e56f5b14602
DTSTART;TZID=America/Toronto:20260309T144500
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260309T154500
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-taite-lagrange-classes-graphs-sub-linear
SUMMARY:Graphs and Matroids - Taite LaGrange-Classes of graphs with sub-lin
 ear\ntwin-width
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Taite LaGrange\n\nAFFILIATION:\n University of Water
 loo\n\nROOM:\n MC 5479\n\nABSTRACT:Twin-width is a graph and matrix parame
 ter introduced in 2021\nby Bonnet\, Kim\, Thomassé\, and Watrigant as ess
 entially a measure of\nthe 'error' between vertex neighbourhoods over a se
 ries of vertex\ncontractions. This talk covers some graph classes with unb
 ounded\ntwin-width. We present a tool for obtaining twin-width bounds in\n
 general by contracting a graph based on a partition by distinct\nneighbour
 hoods. For a graph G on n vertices\, we show that if such a\npartition exi
 sts\, then the twin-width of G is at worst sub-linear with\nrespect to n. 
 We use this to obtain an upper bound on the twin-width\nof interval graphs
  and of graphs with bounded VC dimension. The latter\nimplies that heredit
 ary classes have sub-linear twin-width if and only\nif they have bounded V
 C dimension.
DTSTAMP:20260420T001211Z
END:VEVENT
END:VCALENDAR