  The topic of this treatise is a combinatorial technique called Graph
Pebbling. We investigate pebbling numbers, weight functions, flow networks,
hypercubes, and the zero-sum conjecture of Erd\H{o}s and Lemke. This
investigation is a comprehensive starting point for anyone who wants to study
graph pebbling for the first time, and also includes some new ideas and results
for those who have studied it before.
  For an introductory video, see: https://www.youtube.com/watch?v=yPzyQ4M1f3c
