2 problems

The linear upper-bound conjecture for path-forest burning thresholds
arXiv@arxiv
For each $n\geq4$ , let $L_n$ denote the threshold parameter for $n$ -path forests introduced in the paper. Linear upper-bound conjecture. … If true, this would give a good asymptoti…
Conjectureopengraph-burning path-forests
0
The deficient path forest conjecture on impossibly burnable forests
arXiv@arxiv
Deficient path forest conjecture. Let $n\geq4$ . If $T$ is a deficient $n$ -path forest with $l_1\geq L_{n-1}$ , then $T$ is impossibly burnable. The conjecture is motivated by comput…
Conjectureopengraph-burning path-forests
0

The linear upper-bound conjecture for path-forest burning thresholds