Title: Bounds on the Cop Number of Lamplighter Graphs

Speaker: Griffin Bartlett, Memorial University of Newfoundland

Abstract: Lamplighter graphs are a class of finite graphs exhibiting exotic geometries. We establish non-trivial upper and lower bounds on the cop number of lamplighter graphs by considering retracts of these graphs, and we provide a linear upper bound on the cop number of a certain subclass of lamplighter graphs by considering the Lamplighter Game played on paths of finite length.

---

Location: HH3017

Date and Time: Thursday, Mar. 12 at 01:00 PM - 01:50 PM (NDT)

---