## Degree sum conditions in graph pebbling

- Anna Blasiak, John Schmitt
- Australasian J. Combinatorics
- 2008

@article{Czygrinow2003PebblingID, title={Pebbling in dense graphs}, author={Andrzej Czygrinow and Glenn H. Hurlbert}, journal={Australasian J. Combinatorics}, year={2003}, volume={28}, pages={201-208} }

- Published 2003 in Australasian J. Combinatorics

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 graph G is the minimum number π(G) so that every configuration of π(G) pebbles is solvable. A graph is Class 0 if its pebbling number equals its number of vertices. A function is a pebbling threshold for a sequence of graphs if a randomly chosen configuration of asymptotically more pebbles is almost surely solvable, while… CONTINUE READING

3 Citations

12 References

Similar Papers