The Burning Number Conjecture for trees

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

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

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