A Survey of Graph Pebbling
| dc.creator | Hurlbert, Glenn | |
| dc.date | 2004-06-01 | |
| dc.date.accessioned | 2026-07-07T05:08:47Z | |
| dc.date.available | 2026-07-07T05:08:47Z | |
| dc.description | 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. | |
| dc.description | 24 pages | |
| dc.identifier | https://arxiv.org/abs/math/0406024 | |
| dc.identifier | http://arxiv.org/abs/math/0406024 | |
| dc.identifier | Congressus Numerantium 139 (1999), 41-64 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71403 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C35, 05C99, 05D05, 06A07, 11B75 | |
| dc.title | A Survey of Graph Pebbling | |
| dc.type | text |