Counterexamples to a monotonicity conjecture for the threshold pebbling number

DOI10.1016/j.disc.2012.04.005zbMath1246.05159arXiv1107.4902OpenAlexW1999266323WikidataQ122956011 ScholiaQ122956011MaRDI QIDQ442335

Cecilia Holmgren, Johan Björklund

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)

Cites Work

• Unnamed Item
• General graph pebbling
• Thresholds for families of multisets, with an application to graph pebbling
• An improved upper bound for the pebbling threshold of the \(n\)-path
• On pebbling threshold functions for graph sequences
• Pebbling in Hypercubes

This page was built for publication: Counterexamples to a monotonicity conjecture for the threshold pebbling number