An improved upper bound for the pebbling threshold of the \(n\)-path

DOI10.1016/j.disc.2002.10.001zbMath1030.05114OpenAlexW1975851722MaRDI QIDQ1420621

Adam Wierman, Anant P. Godbole, Michael Jablonski, Julia Salzman

Publication date: 2 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2002.10.001

zbMATH Keywords

\(n\)-Cycle\(n\)-PathPebbling numberPebbling threshold

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (4)

General graph pebbling ⋮ Counterexamples to a monotonicity conjecture for the threshold pebbling number ⋮ On the pebbling threshold of paths and the pebbling threshold spectrum ⋮ Threshold and complexity results for the cover pebbling game

Cites Work

• Unnamed Item
• Unnamed Item
• An addition theorem on the integers modulo \(n\)
• Thresholds for families of multisets, with an application to graph pebbling
• On pebbling threshold functions for graph sequences
• Pebbling in Hypercubes

This page was built for publication: An improved upper bound for the pebbling threshold of the \(n\)-path