5 papers
Girth, Pebbling, and Grid Thresholds
Andrzej Czygrinow, Glenn Hurlbert
In this note we answer a question of Hurlbert about pebbling in graphs of high girth. Specifically we show that for every g there is a Class 0 graph of girth at least g. The proof…
On the Pebbling Threshold Spectrum
Andrzej Czygrinow, Glenn Hurlbert
A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. A function is a pebbling thre…
Pebbling in Dense Graphs
Andrzej Czygrinow, Glenn Hurlbert
A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. The pebbling number of a grap…
Thresholds for families of multisets, with an application to graph pebbling
Airat Bekmetjev, Graham Brightwell, Andrzej Czygrinow +1
In this paper we prove two multiset analogs of classical results. We prove a multiset analog of Lovasz's version of the Kruskal-Katona Theorem and an analog of the Bollobas-Thomaso…
A Note on Graph Pebbling
Andrzej Czygrinow, Glenn Hurlbert, Hal Kierstead +1
We say that a graph G is Class 0 if its pebbling number is exactly equal to its number of vertices. For a positive integer d, let k(d) denote the least positive integer so that eve…