Almost-all graphs greedy and tree-solvable conjecture
Statement
A graph is greedy if every configuration of pebbles can be solved at any specified root using only greedy pebbling steps. It is tree-solvable if every configuration of size 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.