Counterexamples to a Monotonicity Conjecture for the Threshold Pebbling Number
Combinatorics
2011-07-26 v1
Abstract
Graph pebbling considers the problem of transforming configurations of discrete pebbles to certain target configurations on the vertices of a graph, using the so-called pebbling move. This paper provides counterexamples to a monotonicity conjecture stated by Hurlbert et al. concerning the pebbling number compared to the pebbling threshold.
Keywords
Cite
@article{arxiv.1107.4902,
title = {Counterexamples to a Monotonicity Conjecture for the Threshold Pebbling Number},
author = {Johan Björklund and Cecilia Holmgren},
journal= {arXiv preprint arXiv:1107.4902},
year = {2011}
}