ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.