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, hybrid mode (zoom or Lippitt 205). Seminar archive.

Speaker Bill Kinnersley, URI
Title The Localization Game on Graphs
Time Friday October 29, 2021, 1pm, zoom
Abstract In the localization game, a team of cops attempts to locate a robber on a graph G. Initially, the robber positions himself at some vertex of G. Next, each cop probes a vertex of G, and the cops learn the distance from each probe to the robber's location. If the cops can pinpoint the robber's location, then the cops win; otherwise, the robber can run to a neighboring vertex. The game continues, alternating between cop probes and robber moves, until the cops win (or concede). The localization number of G is the minimum number of cops - that is, the minimum number of probes per turn - needed for the cops to win. In this talk, we present some recent work on the localization number, including bounds on the localization numbers of outerplanar graphs and hypercubes, along with a surprising connection to the chromatic number. This is joint work with Anthony Bonato.

News


Faculty and their research
     Michael Barrus, graph theory
     Nancy Eaton, graph theory
     Barbara Kaskosz, analysis and its applications to discrete mathematics
     William Kinnersley, graph theory and combinatorial games
     Lubos Thoma, extremal and probabilistic combinatorics

Doctoral students
     Emily Barranca
     Erika Fiore
     John Jones
     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