73 citations · 73 across the 3 of their papers we have counts for
4 papers
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…
Majority Bootstrap Percolation on
Cecilia Holmgren, Tomas Juškevičius, Nathan Kettle
Majority bootstrap percolation on a graph is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step…
Turán Numbers for Forests of Paths in Hypergraphs
Neal Bushaw, Nathan Kettle
The Turán number of an r-uniform hypergraph H is the maximum number of edges in any r-graph on n vertices which does not contain H as a subgraph. Let P_l^(r) denote the family of r…
Turàn numbers of Multiple Paths and Equibipartite Trees
Neal Bushaw, Nathan Kettle
The Turán number of a graph H, ex(n;H), is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let P_l denote a path on l vertices, and k…