General graph pebbling

Authors:
Glenn Hurlbert
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 19
Cited 0

Threshold functions

Combinatorica
Hamiltonian uniform subset graphs

Journal of Combinatorial Theory Series B
Pebbling in hypercubes

SIAM Journal on Discrete Mathematics
Pebbling graphs

Journal of Combinatorial Theory Series B
On Davenport's constant

Journal of Combinatorial Theory Series A
Zero-sum problems—a survey

Discrete Mathematics
The pebbling number of C5 × C5

Discrete Mathematics
The optimal pebbling number of the complete m-ary tree

Discrete Mathematics
On Davenport's constant of finite abelian groups with rank three

Discrete Mathematics
On pebbling threshold functions for graph sequences

Discrete Mathematics
Thresholds for random distributions on graph sequences with applications to pebbling

Discrete Mathematics
Zero-sum problems and coverings by proper cosets

European Journal of Combinatorics
Thresholds for families of multisets, with an application to graph pebbling

Discrete Mathematics
On a Result of Lemke and Kleitman

Combinatorics, Probability and Computing
Girth, Pebbling, and Grid Thresholds

SIAM Journal on Discrete Mathematics
The Complexity of Graph Pebbling

SIAM Journal on Discrete Mathematics
Pebbling and optimal pebbling in graphs

Journal of Graph Theory
Graham's pebbling conjecture on products of cycles

Journal of Graph Theory
Maximum pebbling number of graphs of diameter three

Journal of Graph Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

Graph pebbling is the study of whether pebbles from one set of vertices can be moved to another while pebbles are lost in the process. A number of variations on the theme have been presented over the years. In this paper we provide a common framework for studying them all, and present the main techniques and results. Some new variations are introduced as well and open problems are highlighted.