1 citations · 1 across the 4 of their papers we have counts for
15 papers
Saturation for the -uniform loose -cycle
Sean English, Alexandr Kostochka, Dara Zirlin
Let and be -uniform hypergraphs. We say is -saturated if does not contain a subgraph isomorphic to , but does for any hyperedge . The…
Low Diameter Monochromatic Covers of Complete Multipartite Graphs
Sean English, Connor Mattes, Grace McCourt +1
Let the diameter cover number, , denote the least integer such that under any -coloring of the edges of the graph , there exists a collection of monochromat…
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…