4 citations · 11 across the 12 of their papers we have counts for
17 papers
The Explorer-Director Game on Graphs
Pat Devlin, Erin Meger, Abigail Raz +1
The Explorer-Director game, first introduced by Nedev and Muthukrishnan, can be described as a game where two players -- Explorer and Director -- determine the movement of a token…
Maximum distances in the four-digit Kaprekar process
Pat Devlin, Tony Zeng
For natural numbers and , the classical Kaprekar function is defined as , where is the rearrangement of the base- digits of in descending order a…
Central Limit Theorem for Majority Dynamics: Bribing Three Voters Suffices
Ross Berkowitz, Pat Devlin
Given a graph and some initial labelling of its vertices, the \textit{majority dynamics model} is the deterministic process where at each stage, eve…
Perfect matchings and derangements on graphs
Matija Bucic, Pat Devlin, Mo Hendon +2
We show that each perfect matching in a bipartite graph intersects at least half of the perfect matchings in . This result has equivalent formulations in terms of the perman…
Palindromes in finite groups and the Explorer-Director game
Dagur Tómas Ásgeirsson, Pat Devlin
In this paper, we use the notion of twisted subgroups (i.e., subsets of group elements closed under the binary operation ) to provide the first structural charac…
Connected-Intersecting Families of Graphs
Aaron Berger, Ross Berkowitz, Pat Devlin +4
For a graph property and a common vertex set , a family of graphs on is \emph{-intersecting} iff satisfies $\math…