ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph is greedy if every configuration of π(G)\pi(G) pebbles can be solved at any specified root using only greedy pebbling steps. It is tree-solvable if every configuration of size π(G)\pi(G) can be solved so that the edges used by pebbling steps form an acyclic graph. Almost-all graphs conjecture. Almost every graph is greedy and tree-solvable.

The paper gives examples of graphs that are neither greedy nor tree-solvable, and notes that even semi-greediness need not be preserved under graph products; the asymptotic assertion itself is left unresolved.

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.