In pursuit-evasion games, a set of pursuers attempts to locate, eliminate, or contain an evader in a network. The rules, specified from the outset, greatly determine the difficulty of the questions posed above. For example, the evader may be visible,

Title: The basics of the deduction game Abstract: The deduction game is a new variant of the classical chasers and runners game where the chasers are trying to catch an invisible runner quickly, but with no communication possible between chasers on

Title: Path decompositions of random directed graphs In this talk we consider the problem of partitioning the edges of a digraph into as few paths as possible. The minimum number of paths needed in such an edge decomposition is called

Improved bounds for zeros of the chromatic polynomial on bounded degree graphs About 20 years ago Sokal proved that there exists a constant C so that for any graph G, all of the complex zeros of its chromatic polynomial are

2017 saw the centennial of William Tutte, one of the greatest mathematicians of modern times.  One of the testimonies to Tutte’s genius is that nearly everything he did proved to be a catalyst, triggering an explosion of further investigations and

I will discuss a few examples where considering loops leads to interesting insights, often allowing unifying existing results. These examples will include cops and robbers games, graph homomorphisms, variants of interval and chordal graphs, and versions of domination. Join Zoom

There are many results about triangles in graphs, but the property that every edge in a graph is in at least one triangle seems not to have been studied before. The 4-regular case was quickly solved collaboratively following an internet