Weak Target Conjecture
Statement
Let be a graph, let be a target, and let denote the total demand of . Write for the pebbling number of with target , and for the -fold pebbling number.
Weak Target Conjecture. Every graph satisfies
for every target .
The conjecture is known for trees, cycles, complete graphs, cubes, 2-paths, and Kneser graphs , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.