The Burning Number Conjecture for trees
Statement
Let be a tree on vertices, and let denote its burning number.
Tree form of the Burning Number Conjecture. Every tree on vertices satisfies
Since every connected graph has a spanning tree and deleting edges cannot decrease the burning number, this is sufficient to prove the Burning Number Conjecture. The assertion is established for several subclasses of trees, but remains open for general trees.
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.