BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:7956@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20151201T143000
DTEND;TZID=Europe/Paris:20151201T153000
DTSTAMP:20241120T205613Z
URL:https://www.i2m.univ-amu.fr/evenements/cops-robbers-infinite-graphs-an
 d-related-problems/
SUMMARY:Gena Hahn (Université de Montréal\, Canada): Cops\, robbers\, inf
 inite graphs and related problems
DESCRIPTION:Gena Hahn: We briefly survey the game of cops-and-robbers on gr
 aphs and its variants in the finite case and then concentrate on infinite 
 graphs\, stressing the difference between the finite and the infinite. Alo
 ng the way we show (time allowing) how to construct infinite-vertex transi
 tive graphs from any graphs and point out some strange properties of the c
 onstruction. We also suggest several open problems\, both finite and inifi
 nite. The talk is based on work with A. Bonato\, C.Tardif and R.E. Woodrow
 .\nhttps://www.youtube.com/watch?v=epaJn8IuOt4
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 020/01/Gena_Hahn.jpg
CATEGORIES:Séminaire,Ernest
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20151025T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR