ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree on nn vertices, and let b(T)b(T) denote its burning number.

Tree form of the Burning Number Conjecture. Every tree on nn vertices satisfies

b(T)≤⌈n⌉.b(T)\leq\lceil\sqrt{n}\rceil.

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 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.