The Burning Graph Conjecture for trees
Statement
Let be a tree on vertices. For a set , say that is -burnable if there is a sequence of vertices such that
where . Here denotes the closed radius- neighborhood of .
Burning Graph Conjecture. Every tree on vertices is -burnable.
This is the tree formulation of the general burning conjecture. It remains open in general, while the paper proves reductions for trees of bounded growth and establishes improved approximate bounds.
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.