Cover Pebbling Thresholds for the Complete Graph

DOI10.1016/J.ENDM.2005.06.046MaRDI QIDQ3439355zbMATH OpenOpenAlexFDO

Authors Anant P. Godbole, Nathaniel G. Watson, Carl Yerger

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.046

zbMATH Keywords

Bose Einsteincompletecover pebblingMaxwell Boltzmannthreshold

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 1439473 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 964350 (Why is no real title available?)
• On pebbling threshold functions for graph sequences
• On the pebbling threshold of paths and the pebbling threshold spectrum
• Pebbling in Hypercubes
• The cover pebbling number of graphs
• Thresholds for families of multisets, with an application to graph pebbling

Cited in

(1)

• Threshold and complexity results for the cover pebbling game

This page was built for publication: Cover Pebbling Thresholds for the Complete Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439355)