BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20250708T200142EDT-85707dflvv@132.216.98.100
DTSTAMP:20250709T000142Z
DESCRIPTION:On Hartnell's Firefighting Problem.\n\nThe firefighter game on 
 graphs was introduced by Bert Hartnell in 1995. Briefly\, an fire breaks o
 ut at a finite set of vertices\; at each time interval n ≥ 1\, a fixed num
 ber of vertices p which are not on fire become protected\; then the fire s
 preads to all unprotected neighbors of vertices on fire\; once a vertex is
  protected or is on fire\, it remains so for all time intervals. The playe
 r looks for an strategy to contain the fire. We study this game and some o
 f its variations and show that the existence of a number p such that there
  is a winning strategy for any initial fire is a quasi-isometry invariant 
 in the class of infinite graphs of bounded degree. Then we start exploring
  these games from geometric group theory point of view. The talk includes 
 joint work with Danny Dyer and Brandon Thorne\, and joint work with Tomasz
  Prytula.\n
DTSTART:20161019T190000Z
DTEND:20161019T200000Z
LOCATION:Room 920\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue 
 Sherbrooke Ouest
SUMMARY:Eduardo Martinez-Pedroza\, Memorial University of Newfoundland
URL:/mathstat/channels/event/eduardo-martinez-pedroza-
 memorial-university-newfoundland-263465
END:VEVENT
END:VCALENDAR