The pebbling threshold of the square of cliques (Q941367)

The authors study the pebbling threshold of the sequence of the cartesian products of cliques with \(N=N(K_{n}^{2})\). The pebbling threshold of a sequence of graphs is the number of pebbles so that almost every (respectively almost no) configuration of asymptotically more (respectively fewer) pebbles can reach any chosen target. The main result of the paper is that the pebbling threshold of the sequence of the cartesian products of cliques with \(N = N(K_{n}^{2})\) is \(\Omega(\sqrt{n})\).