Extending graph burning to hypergraphs

DOI10.26493/1855-3974.3451.46FMaRDI QIDQ7295089zbMATH OpenFDO

Authors Andrea Burgess, Caleb W. Jones, David A. Pike

Publication date 13 July 2026

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.26493/1855-3974.3451.46F

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Games involving graphs (91A43) Combinatorial games (91A46)

Cites work

• \(\mathcal{U}\)-bootstrap percolation: critical probability, exponential decay and applications
• A sharp threshold for bootstrap percolation in a random hypergraph
• A survey of graph burning
• Bootstrap percolation in random k-uniform hypergraphs
• Bootstrap percolation on the random graph \(G_{n,p}\)
• Bounds on the burning number
• Burning a graph as a model of social contagion
• Burning a graph is hard
• Connection and separation in hypergraphs
• Connectivity in hypergraphs
• Extremal bounds for bootstrap percolation in the hypercube
• How to Burn a Graph
• How to burn a Latin square
• Hypergraph theory. An introduction
• Linear algebra and bootstrap percolation
• Transmitting in the n-dimensional cube

This page was built for publication: Extending graph burning to hypergraphs

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