On the Target Pebbling Conjecture

TL;DR

This paper proves the Target Pebbling Conjecture for 2-paths and Kneser graphs, advancing understanding of pebbling numbers and their maximum configurations in graph theory.

Contribution

It extends the proof of the Target Pebbling Conjecture to new classes of graphs, specifically 2-paths and Kneser graphs, which were previously unverified.

Findings

Conjecture holds for 2-paths.

Conjecture holds for Kneser graphs over pairs.

Provides new insights into graph pebbling configurations.

Abstract

Graph pebbling is a network optimization model for satisfying vertex demands with vertex supplies (called pebbles), with partial loss of pebbles in transit. The pebbling number of a demand in a graph is the smallest number for which every placement of that many supply pebbles satisfies the demand. The Target Conjecture (Herscovici-Hester-Hurlbert, 2009) posits that the largest pebbling number of a demand of fixed size $t$ occurs when the demand is entirely stacked on one vertex. This truth of this conjecture could be useful for attacking many open problems in graph pebbling, including the famous conjecture of Graham (1989) involving graph products. It has been verified for complete graphs, cycles, cubes, and trees. In this paper we prove the conjecture for 2-paths and Kneser graphs over pairs.