ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph of order nn, and let b(G)b(G) denote its burning number. Bonato, Janssen, and Roshanbin's conjecture.

b(G)≤⌈n⌉.b(G)\leq \left\lceil\sqrt{n}\right\rceil.

This conjecture would improve the general bound b(G)≤2⌈n⌉−1b(G)\leq 2\left\lceil\sqrt{n}\right\rceil-1 and seeks the sharp order-of-magnitude upper bound for the burning number of connected graphs. It is presented as an open problem.

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.