The burning number conjecture holds asymptotically

DOI10.1016/J.JCTB.2024.05.003MaRDI QIDQ6564610zbMATH OpenFDO

Authors Serguei Norine, Jérémie Turcotte

Publication date 1 July 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.05.003

zbMATH Keywords

burning number conjecturegraph burningtrees

Mathematics Subject Classification ID

Trees (05C05) Games on graphs (graph-theoretic aspects) (05C57) Graph algorithms (graph-theoretic aspects) (05C85) Games involving graphs (91A43)

Recommendations

• Improved pyrotechnics: closer to the burning number conjecture
• The burning number conjecture is true for trees without degree-2 vertices
• An upper bound on the burning number of graphs
• Burning graph classes
• Bounds on the burning number

Cites work

• A course on point processes
• A survey of graph burning
• An upper bound on the burning number of graphs
• Bounds on the burning number
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph as a model of social contagion
• Burning number of caterpillars
• Burning spiders
• How to Burn a Graph
• scientific article; zbMATH DE number 3132851 (Why is no real title available?)
• Improved pyrotechnics: closer to the burning number conjecture
• On the burning number of \(p\)-caterpillars
• Probability Inequalities for Sums of Bounded Random Variables
• Transmitting in the n-dimensional cube

Cited in

(16)

• Improved pyrotechnics: closer to the burning number conjecture
• The burning number conjecture is true for trees without degree-2 vertices
• Burning Hamming graphs
• Adversarial graph burning densities
• Upper bounds and approximation results for the \(k\)-slow burning problem
• The burning game on graphs
• Burning sufficiently large p-caterpillars for a fixed p
• Burning disjoint union of spider and path
• Burning path-like and clique-like graphs
• From burning extremal balanced spiders into properties for generalization to all trees
• Information dissemination and confusion in signed networks
• A note on graph burning of path forests
• Orientable burning number of graphs
• Burning random trees
• A row generation algorithm for finding optimal burning sequences of large graphs
• The k-radius of 2-connected graphs

This page was built for publication: The burning number conjecture holds asymptotically

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564610)