Burning Number Conjecture for connected graphs
Statement
Let be a connected graph on vertices, and let denote the minimum number of rounds needed to burn all vertices of . Burning Number Conjecture.
This conjecture proposes a sharp upper bound for graph burning, improving the previously known bound and one attained by paths. It remains a central open problem in the area.
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.