A note on graph pebbling (Q1606023)

For a positive integer \(d\), let \(k(d)\) denote the least positive integer so that every graph \(G\) with diameter at most \(d\) and connectivity at least \(k(d)\) has the property that its pebbling number equals its number of vertices. The authors prove the existence of such a function, which was conjectured by \textit{T. A. Clarke}, \textit{R. A. Hochberg} and \textit{G. H. Hurlbert} [J. Graph Theory 25, 119-128 (1997; Zbl 0881.05109)].