Department of Mathematical SciencesEvents People Colloquia and Seminars Conferences Centers Positions Areas of Research About the Department Alumni
Algorithms, Combinatorics and Optimization Seminar
For more information, please visit the home page for the program in Algorithms, Combinatorics and Optimization at Carnegie Mellon University.
Carnegie Mellon University offers an interdisciplinary Ph.D program in Algorithms, Combinatorics and Optimization. This program is the first of its kind in the United States. It is administered jointly by the Tepper School of Business (Operations Research group), the Computer Science Department (Algorithms and Complexity group) and the Department of Mathematical Sciences (Discrete Mathematics group). (Learn more...)
Title: 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.
Date: Thursday, February 20, 2014
Time: 3:30 pm
Location: Wean Hall 8220
Submitted by: Boris Bukh