73 citations · 82 across the 14 of their papers we have counts for
12 papers · 1 filter
3-Neighbor bootstrap percolation on two-dimensional grids
Neal Bushaw, Alexander Clifton
In the -neighbor bootstrap percolation process, a vertex becomes (and remains) infected if at least three of its neighbors are infected. We say that an initial configuration of…
The Saturation Spectrum of Berge Stars
Neal Bushaw, Sean English, Emily Heath +2
The forbidden subgraph problem is among the oldest in extremal combinatorics -- how many edges can an -vertex -free graph have? The answer to this question is the well-studie…
Thresholds for Pebbling on Grids
Neal Bushaw, Nathan Kettle
Given a connected graph and a configuration of pebbles on the vertices of G, a -pebbling step consists of removing pebbles from a vertex, and adding a single pebble…
Rainbow Turán Methods for Trees
Vic Bednar, Neal Bushaw
The rainbow Turán number, a natural extension of the well studied traditional Turán number, was introduced in 2007 by Keevash, Mubayi, Sudakov and Verstraëte. The rainbow Turán num…
Rainbow Saturation
Neal Bushaw, Daniel Johnston, Puck Rombach
We introduce a notion of rainbow saturation and the corresponding rainbow saturation number. This is the saturation version of the rainbow Turán numbers whose systematic study was…
Even cycles in dense graphs
Neal Bushaw, Andrzej Czygrinow, Jangwon Yie
We will show that for there is such that if is a graph on vertices such that , then for every , contai…