Hypergraph burning, matchings, and zero forcing

DOI10.1016/J.TCS.2025.115529MaRDI QIDQ6903532zbMATH OpenFDO

Authors Anthony Bonato, Caleb W. Jones, Trent Gregory Marbach, Teddy Mishura, Zhiyuan Zhang

Publication date 10 November 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115529

zbMATH Keywords

burninghypergraphsmatchingszero forcing

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Games involving graphs (91A43)

Cites work

• A survey of graph burning
• An invitation to pursuit-evasion games and graph theory
• Burning a graph as a model of social contagion
• Fast-mixed searching and related problems on graphs
• How to Burn a Graph
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Hypergraph theory. An introduction
• Inverse Problems and Zero Forcing for Graphs
• Minimum rank of skew-symmetric matrices described by a graph
• The minimum rank of symmetric matrices described by a graph: a survey
• Zero forcing sets and the minimum rank of graphs

This page was built for publication: Hypergraph burning, matchings, and zero forcing

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