Gena Hahn
Université de Montréal, Canada
http://www.iro.umontreal.ca/~hahn/
Date(s) : 01/12/2015 iCal
14 h 30 min - 15 h 30 min
We briefly survey the game of cops-and-robbers on graphs and its variants in the finite case and then concentrate on infinite graphs, stressing the difference between the finite and the infinite. Along the way we show (time allowing) how to construct infinite-vertex transitive graphs from any graphs and point out some strange properties of the construction. We also suggest several open problems, both finite and inifinite. The talk is based on work with A. Bonato, C.Tardif and R.E. Woodrow.
Catégories