**Discrete Mathematics Group at URI**

The faculty of our group is interested in a wide range of areas in discrete mathematics
both pure and applied: graph theory, network theory, extremal and probabilistic methods,
analytic methods, finite model theory, combinatorial games, combinatorial optimization,
bioinformatics applications.

**Seminar**
Our seminar is held **Fridays 1-2pm in Lippitt 204**.
Seminar archive.

Speaker | Anthony Bonato, Ryerson University |

Title | What we know and don't know about the cop number of a graph |

Time | Wednesday March 4, 2020, 1-2pm, Lippitt 204 |

Abstract |
The game of Cops and Robbers played on graphs gives rise to
a rich theory focusing on the cop number of a graph. While we possess
a good structural and algorithmic understanding of the cop number for
many graph families, Meyniel's conjecture and Schroeder's conjecture
point to our limited understanding of this parameter. We give an
overview of major results and conjectures on the cop number of graphs,
and consider recent variants such as Lazy Cops and Robbers, Zombies
and Survivors, and the localization game.
Host: W. Kinnersley |

**News**

- Discrete Math Day at the University of Rhode Island, September 29, 2018.
- Conference announcements at Theorynet, DMANet, and a few other.
- Workshop "Non-Combinatorial Combinatorics" will be held at the University of Warwick, 14-16 September 2015, conference webpage.
- The 1st Cargese Fall School on Random Graphs will be held in Cargese, Corsica. September 20-25, 2015. Further details can be found at http://math.unice.fr/~dmitsche/Fallschool/Fallschool.html.

**Faculty and their research**

Michael Barrus, graph theory

Nancy Eaton, graph theory

Jie Han, extremal and probabilistic combinatorics

Barbara Kaskosz, analysis
and its applications to discrete mathematics

William Kinnersley,
graph theory and combinatorial games

Lubos Thoma, extremal and probabilistic combinatorics

**Doctoral students**

Erika Fiore

John Jones

Benjamin Lantz

Eric Peterson

Nikolas Townsend

**Graduate courses **
MTH547 *Combinatorics*,
MTH548 *Graph Theory*,
MTH515/516 *Algebra*,
MTH550 *Probability and Stochastic Processes*,
MTH581 *Optimization Methods*,
MTH656 *Probability on Discrete Structures*,
CSC541 *Advanced Topics in Algorithms*,
CSC542 *Mathematical Analysis of Algorithms*,
CSC544 *Theory of Computation*,
*Special topics courses* in Extremal Graph Theory, Ramsey Theory, Algebraic Combinatorics.

**Discrete mathematics nearby**

MIT Combinatorics seminar | Brown Discrete Mathematics seminar / applied seminars | |

MIT Probability seminar | Yale Combinatorics and probability seminar | |

ICERM | CMSA |