881 citations
- Lawrence Berkeley National LaboratoryUS6 papers
- Lawrence Livermore National LaboratoryUS6 papers
- University of WollongongAU4 papers
- Dartmouth CollegeUS3 papers
- Dartmouth HospitalGB3 papers
- Scuola Internazionale Superiore di Studi AvanzatiIT3 papers
- University of ArizonaUS3 papers
- University of LeicesterGB3 papers
- University of TrentoIT3 papers
- University of Wisconsin–MadisonUS3 papers
- UNSW SydneyAU3 papers
- AREA Science ParkIT2 papers
5 papers · 2 filters
An application of graph pebbling to zero-sum sequences in abelian groups
Shawn Elldge, Glenn H. Hurlbert
A sequence of elements of a finite group G is called a zero-sum sequence if it sums to the identity of G. The study of zero-sum sequences has a long history with many important app…
The Cover Pebbling Number of Graphs
Betsy Crull, Tammy Cundiff, Paul Feltman +4
A pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a spec…
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…
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…