A few random open problems, some of them for random graphs
Graphs, Hypergraphs, and Computing
02 May 11:30 - 12:30
Pawel Pralat - Ryerson University
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.
Magnus M. Halldorsson
Adam Mickiewicz University
Technical University of Denmark, DTU