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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0d13d61fa7
DTSTART;TZID=America/Toronto:20240312T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240312T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-ronen-wdowinski
SUMMARY:Graphs and Matroids - Ronen Wdowinski
CLASS:PUBLIC
DESCRIPTION:TITLE: Constructing graphs with no independent transversals\n\n
 SPEAKER:\n Ronen Wdowinski\n\nAFFILIATION:\n University of Waterloo\n\nLOC
 ATION:\n MC 5417\n\nABSTRACT: An independent transversal in a vertex-parti
 tioned graph is\nan independent set of the graph that contains one vertex 
 from each\npartition class. There are many theorems guaranteeing the exist
 ence of\nan independent transversal when the class sizes are sufficiently 
 large\ncompared to the maximum degree of the graph. I will describe an\nef
 fective combinatorial method for constructing graphs with no\nindependent 
 transversals that are extremal for these theorems. I will\nthen present an
  application to graph list coloring based on color\ndegree. This is joint 
 work with Penny Haxell.
DTSTAMP:20260404T085213Z
END:VEVENT
END:VCALENDAR