13 citations · 19 across the 15 of their papers we have counts for
7 papers · 1 filter
Improved Bounds for Burning Fence Graphs
Anthony Bonato, Sean English, Bill Kay +1
Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The burning process takes place in synchronous, discrete rounds. In each round, a fire br…
Localization Game for Random Graphs
Andrzej Dudek, Sean English, Alan Frieze +2
We consider the localization game played on graphs in which a cop tries to determine the exact location of an invisible robber by exploiting distance probes. The corresponding grap…
Probabilistic Zero Forcing on Random Graphs
Sean English, Calum MacRury, Pawel Pralat
Zero forcing is a deterministic iterative graph coloring process in which vertices are colored either blue or white, and in every round, any blue vertices that have a single white…
On the weight of Berge--free hypergraphs
Sean English, Dániel Gerbner, Abhishek Methuku +1
For a graph , we say a hypergraph is a Berge- if it can be obtained from by replacing each edge of with a hyperedge containing it. A hypergraph is Berge--free if i…
The Iterated Local Model for Social Networks
Anthony Bonato, Huda Chuangpishit, Sean English +2
On-line social networks, such as in Facebook and Twitter, are often studied from the perspective of friendship ties between agents in the network. Adversarial ties, however, also p…
Optimizing the trade-off between number of cops and capture time in Cops and Robbers
Anthony Bonato, Jane Breen, Boris Brimkov +6
The cop throttling number of a graph for the game of Cops and Robbers is the minimum of , where is the number of cops and is the minimu…
A Sublinear Bound on the Cop Throttling Number of a Graph
Anthony Bonato, Sean English
We provide a sublinear bound on the cop throttling number of a connected graph. Related to the graph searching game Cops and Robbers, the cop throttling number, written $\mathrm{th…