Feb. 20, 3:30pm, Wean 8220
Pawel Pralat, Ryerson University
A few random open problems, some of them for random graphs
Abstract:
I am going to present a few open problems I am recently thinking about.
These problems are related to: 1) total acquisition in random graphs, 2) the
acquaintance time of random graphs, 3) lazy cops and robbers, 4) cops and robbers on
Boolean lattice.
The ACO Seminar (2013–2014)