A Survey of Graph Pebbling
By Glenn H. Hurlbert. 2004
127 citations recorded by the source corpus.
We survey results on the pebbling numbers of graphs as well as their historical connection with a number-theoretic question of Erd\H os and Lemke. We also present new results on two probabilistic pebbling considerations, first the random graph threshold for the property that the pebbling number of a graph equals its number of vertices, and second the pebbling threshold function for various natural graph sequences. Finally, we relate the question of the existence of pebbling thresholds to a strengthening of the normal property of posets, and show that the multiset lattice is not supernormal.
Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/79f01cee07ae252843ac61d09636d130628bf4f1
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
Citations in the corpus
- On H-immersions (2008, unknown): “Surveys by Hurlbert [ 7 , 8] describe this history, early results, and recent directions.”
- Recent Progress in Graph Pebbling (2005, methodology): “Since the publication of the graph pebbling survey [54] there has been a great deal of activity in the subject.”