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:6830b8fa1774e DTSTART;TZID=America/Toronto:20221103T130000 SEQUENCE:0 TRANSP:TRANSPARENT DTEND;TZID=America/Toronto:20221103T130000 URL:/combinatorics-and-optimization/events/algebraic-co mbinatorics-seminar-jeremy-chizewer SUMMARY:Algebraic Combinatorics Seminar - Jeremy Chizewer CLASS:PUBLIC DESCRIPTION:Summary \n\nTitle: The Hat Guessing Number of Graphs\n\nSpeaker :\n Jeremy Chizewer\n\nAffiliation:\n University of À¶Ý®ÊÓÆµ\n\nLocation:\ n MC 5479 in person\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 placed on the _n_ vertices of _G_\, each\nwearing a hat whose color is arbitrarily chosen from a set\nof _q_ possible colors . Each player can see the hat colors of his\nneighbors\, but not his own h at color. All of the players are asked to\nguess their own hat colors simu ltaneously\, according to a\npredetermined guessing strategy and the hat c olors they see\, where no\ncommunication between them is allowed. \n DTSTAMP:20250523T180546Z END:VEVENT END:VCALENDAR