Department of Mathematics

Combinatorics and Graph Theory

  •  Robert Bell, MSU
  •  Variations of cops and robbers on infinite graphs
  •  11/06/2019
  •  3:00 PM - 3:50 PM
  •  C304 Wells Hall

The game of cops and robbers is a two player pursuit and evasion game played on a discrete graph G. We study a variation of the classical rules which leads to a different invariant when G is an infinite graph. In this variation, called "weak cops and robbers," the cops win by preventing the robber from visiting any vertex infinitely often. In the classical game, if G is connected and planar, then the cops can always win if there are at least three cops. We prove that this is true in the weak game if G is a locally finite plane graph with no vertex accumulation points.

 

Contact

Department of Mathematics
Michigan State University
619 Red Cedar Road
C212 Wells Hall
East Lansing, MI 48824

Phone: (517) 353-0844
Fax: (517) 432-1562

College of Natural Science