Counterexamples to a monotonicity conjecture for the threshold pebbling number
From MaRDI portal
Publication:442335
DOI10.1016/J.DISC.2012.04.005zbMATH Open1246.05159arXiv1107.4902OpenAlexW1999266323WikidataQ122956011 ScholiaQ122956011MaRDI QIDQ442335FDOQ442335
Authors: Johan Björklund, Cecilia Holmgren 
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1107.4902
Recommendations
- The pebbling threshold of the square of cliques
- On the pebbling threshold of paths and the pebbling threshold spectrum
- On pebbling threshold functions for graph sequences
- Thresholds for random distributions on graph sequences with applications to pebbling
- Thresholds for families of multisets, with an application to graph pebbling
Extremal problems in graph theory (05C35) Combinatorial inequalities (05A20) Extremal set theory (05D05)
Cites Work
Cited In (5)
- The pebbling threshold of the square of cliques
- Thresholds for families of multisets, with an application to graph pebbling
- An improved upper bound for the pebbling threshold of the \(n\)-path
- The Mondrian Puzzle: A Bound Concerning the $M(n) = 0$ Case
- Thresholds for random distributions on graph sequences with applications to pebbling
This page was built for publication: Counterexamples to a monotonicity conjecture for the threshold pebbling number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442335)
