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:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e37cb4de7c4
DTSTART;TZID=America/Toronto:20221114T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221114T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-jeremy-chizewer
SUMMARY:Graphs and Matroids Seminar - Jeremy Chizewer
CLASS:PUBLIC
DESCRIPTION:Title: The Hat Guessing Number of Graphs\n\nSpeaker:\n Jeremy C
 hizewer\n\nAffiliation:\n University of Waterloo\n\nLocation:\n MC 6029\n\
 nAbstract:  The hat guessing number _HG(G)_ of a\ngraph _G_ on _n_ 
 vertices is defined in terms of the following\ngame: _n_ players are pla
 ced on the _n_ vertices of _G_\, each\nwearing a hat whose color is arb
 itrarily chosen from a set\nof _q_ possible colors. Each player can see 
 the hat colors of his\nneighbors\, but not his own hat color. All of the p
 layers are asked to\nguess their own hat colors simultaneously\, according
  to a\npredetermined guessing strategy and the hat colors they see\, where
  no\ncommunication between them is allowed. The hat guessing\nnumber _HG(
 G)_ is the largest integer _q_ such that there exists a\nguessing strat
 egy guaranteeing at least one correct guess for any hat\nassignment of _q
 _ possible colors.
DTSTAMP:20260418T124436Z
END:VEVENT
END:VCALENDAR