MATH 428
Catching Robbers and Spreading Information Spring 2020
Division III Quantative/Formal Reasoning

Class Details

Cops and robbers is a widely studied game played on graphs that has connections to searching algorithms on networks. The cop number of a graph is the smallest number of cops needed to guarantee that the cops can catch a robber in the graph. Similar combinatorial games such as “zero forcing” can be used to model the spread of information. The idea of “throttling” is to spread the information (or catch the robber) as efficiently as possible. This course will survey some of the main results about cops and robbers and the cop number. We will also explore recent research on throttling for cops and robbers, zero forcing, and other variants.
The Class: Format: lecture; interactive activities and discussion
Limit: 25
Expected: 20
Class#: 3548
Grading: yes pass/fail option, no fifth course option
Requirements/Evaluation: problem sets, investigation journal, final presentation
Prerequisites: MATH 200 and MATH 355
Enrollment Preferences: seniors
Distributions: Division III Quantative/Formal Reasoning
QFR Notes: The course will involve mathematical proofs.

Class Grid

Updated 11:56 pm ET

Course Catalog Search

(searches Title and Course Description only)



Start Time
End Time