13 citations · 19 across the 15 of their papers we have counts for
6 papers · 1 filter
Zero Forcing Number of Random Regular Graphs
Deepak Bal, Patrick Bennett, Sean English +2
The zero forcing process is an iterative graph colouring process in which at each time step a coloured vertex with a single uncoloured neighbour can force this neighbour to become…
Nearly-Regular Hypergraphs and Saturation of Berge Stars
Bethany Austhof, Sean English
Given a graph , we say a -uniform hypergraph on the same vertex set contains a Berge- if there exists an injection such that for each…
Weighted Turan Problems with Applications
Patrick Bennett, Sean English, Maria Talanda-Fisher
Suppose the edges of are assigned weights by a weight function . We define the {\em weighted extremal number} \[ \mathrm{ex}(n,w,F):=\max\{w(G)\mid G\subseteq K_n,\text{ a…
Linearity of Saturation for Berge Hypergraphs
Sean English, Dániel Gerbner, Abhishek Methuku +1
For a graph , we say a hypergraph is Berge- if it can be obtained from be replacing each edge of with a hyperedge containing it. We say a hypergraph is Berge--…
A random variant of the game of plates and olives
Andrzej Dudek, Sean English, Alan Frieze
The game of plates and olives was originally formulated by Nicolaescu and encodes the evolution of the topology of the sublevel sets of Morse functions. We consider a random varian…
The zero forcing polynomial of a graph
Kirk Boyer, Boris Brimkov, Sean English +5
Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to beco…