Thresholds for families of multisets, with an application to graph pebbling
From MaRDI portal
Publication:1402065
DOI10.1016/S0012-365X(02)00745-8zbMath1028.05112arXivmath/0406068MaRDI QIDQ1402065
Airat Bekmetjev, Andrzej Czygrinow, Graham R. Brightwell, Glenn H. Hurlbert
Publication date: 19 August 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0406068
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Combinatorial inequalities (05A20) Extremal set theory (05D05)
Related Items
The weight function lemma for graph pebbling ⋮ General graph pebbling ⋮ Counterexamples to a monotonicity conjecture for the threshold pebbling number ⋮ An improved upper bound for the pebbling threshold of the \(n\)-path ⋮ On the pebbling threshold of paths and the pebbling threshold spectrum ⋮ The pebbling threshold of the square of cliques ⋮ Threshold and complexity results for the cover pebbling game ⋮ Cover Pebbling Thresholds for the Complete Graph