73 citations · 73 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2023
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…
math.CO2013
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…
math.CO2011★ 73 cited
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…