Counterexamples to a monotonicity conjecture for the threshold pebbling number

DOI10.1016/J.DISC.2012.04.005MaRDI QIDQ442335zbMATH OpenOpenAlexWikidataFDO

Authors Johan Björklund, Cecilia Holmgren

Publication date 10 August 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1107.4902

zbMATH Keywords

pebbling numbergraph pebblingpebbling threshold

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial inequalities (05A20) Extremal set theory (05D05)

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.

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

Cites work

• scientific article; zbMATH DE number 1439473 (Why is no real title available?)
• An improved upper bound for the pebbling threshold of the \(n\)-path
• General graph pebbling
• On pebbling threshold functions for graph sequences
• Pebbling in Hypercubes
• Thresholds for families of multisets, with an application to graph pebbling

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)