On the pebbling threshold of paths and the pebbling threshold spectrum

DOI10.1016/j.disc.2007.06.045zbMath1145.05050arXivmath/0406124OpenAlexW2034461407MaRDI QIDQ932604

Andrzej Czygrinow, Glenn H. Hurlbert

Publication date: 11 July 2008

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

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

zbMATH Keywords

pathsspectrumthresholdpebbling

Mathematics Subject Classification ID

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

Related Items (4)

The weight function lemma for graph pebbling ⋮ General graph pebbling ⋮ Threshold and complexity results for the cover pebbling game ⋮ Cover Pebbling Thresholds for the Complete Graph

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: On the pebbling threshold of paths and the pebbling threshold spectrum