← All problems

Weak Target Conjecture

1 year old · traced to

Let GG be a graph, let DD be a target, and let ∣D∣|D| denote the total demand of DD. Write π(G,D)\pi(G,D) for the pebbling number of GG with target DD, and πt(G)\pi_t(G) for the tt-fold pebbling number.

Weak Target Conjecture. Every graph GG satisfies

π(G,D)≤π∣D∣(G)\pi(G,D)\leq \pi_{|D|}(G)

for every target DD.

The conjecture is known for trees, cycles, complete graphs, cubes, 2-paths, and Kneser graphs K(m,2)K(m,2), according to the source, but no general proof is supplied.

References
  1. Matheus Adauto, Viktoriya Bardenova, Yunus Bidav and Glenn Hurlbert, “Target Pebbling in Trees”, arXiv:2504.10460 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.