ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph on nn vertices, and let b(G)b(G) denote the minimum number of rounds needed to burn all vertices of GG. Burning Number Conjecture.

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

This conjecture proposes a sharp upper bound for graph burning, improving the previously known bound b(G)≤2⌈n⌉−1b(G)\leq 2\lceil\sqrt{n}\rceil-1 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 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.