Mathematics – Combinatorics
Scientific paper
2004-06-01
Congressus Numerantium 139 (1999), 41-64
Mathematics
Combinatorics
24 pages
Scientific paper
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.
No associations
LandOfFree
A Survey of Graph Pebbling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Survey of Graph Pebbling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Survey of Graph Pebbling will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-348631