ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree on nn vertices. For a set B⊆NB\subseteq\mathbb{N}, say that TT is BB-burnable if there is a sequence of vertices X={v1,…,vj}X=\{v_1,\ldots,v_j\} such that

⋃i∈{1,…,j}Nbi[vi]=V(T),\bigcup_{i\in\{1,\ldots,j\}}N_{b_i}[v_i]=V(T),

where B={b1,…,bj}B=\{b_1,\ldots,b_j\}. Here Nr[v]N_r[v] denotes the closed radius-rr neighborhood of vv.

Burning Graph Conjecture. Every tree TT on nn vertices is {0,…,⌈n⌉−1}\{0,\ldots,\lceil\sqrt{n}\rceil-1\}-burnable.

This is the tree formulation of the general burning conjecture. It remains open in general, while the paper proves reductions for trees of bounded growth and establishes improved approximate bounds.

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.