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:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e0c40ddb21c
DTSTART;TZID=America/Toronto:20220712T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220712T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graph-and-ma
 troids-seminar-hidde-koert
SUMMARY:Graph and Matroids Seminar - Hidde Koert
CLASS:PUBLIC
DESCRIPTION:TITLE: The _k_-independence number of graph products\n\nSpeaker
 :\n Hidde Koerts\n\nAffiliation:\n University of Waterloo\n\nLocation:\n M
 C 5417\n\nABSTRACT: The _k_-independence number of a graph is the maximum 
 size\nof a set of vertices at pairwise distance greater than _k_\,\ngenera
 lizing the standard independence number. In this talk\, I will\ndiscuss we
 ll-known sharp bounds on the independence number of graph\nproducts\, and 
 extend some of these bounds to the _k_-independence\nnumber. Specifically\
 , we will cover the Cartesian\, tensor\, strong\, and\nlexicographic produ
 cts.\n\nJoint work with Aida Abiad.
DTSTAMP:20260416T111213Z
END:VEVENT
END:VCALENDAR