Graph Searching Games and Probabilistic Methods

Dr. Anthony Bonato is a professor of Mathematics at Ryerson University, whose main research interests are in graph theory and complex networks. He is co-Editor-in-Chief of Internet Mathematics, editor for Contributions to Discrete Mathematics, and Chair of the Pure Mathematics group within the NSERC Discovery Grants Mathematics and Statistics Evaluation Group.Dr. Pawel Prałat is an associate professor at Ryerson University whose main research interests are in graph theory and complex networks. He is the Assistant Director of Industry Liaison at The Fields Institute for Research in Mathematical Sciences, and has pursued collaborations with various industry partners as well as the Government of Canada.

"Pursuit-evasion games is an exciting branch of graph theory, with many innocent looking problems that are very di□cult to solve. Written by two experts in this lively area, this book surveys the state-of-the-art results in this area and explains the most important ideas in an engaging manner. Another important theme in this book is probabilistic methods; through fascinating and fun graph searching games, the book covers quite a range of important tools from probabilistic methods and random graphs.This book is fun to read, accessible to students as well as to researchers, and it is an attractive resource for everyone who wants to enter any of these three areas: graph searching games, probabilistic methods, or random graphs. It can also be used as the textbook for a graduatecourse on these topics." Abbas Mehrabian (Montr□eal)

• Preface; Chapter 1: Introduction; 2: The Game of Cops and Robbers; 3. Variations of Cops and Robbers; 4. Large Cop Number and Meyniel’s Conjecture; 5. Graph Cleaning; 6. Acquaintance Time; 7. Random Geometric Graphs; 8. Firefighting and Seepage; 9. Miscellaneous Topics; Bibliography; Index