A new lower bound on the pebbling number of the grid

Jan Petr, Julien Portier, Szymon Stolarczyk

A pebbling move on a graph consists of removing $2$ pebbles from a vertex and adding $1$ pebble to one of the neighbouring vertices. A vertex is called reachable if we can put $1$…