Burning the plane. Densities of the infinite Cartesian grid

DOI10.1007/s00373-020-02182-9zbMath1458.05119arXiv1806.05642OpenAlexW3123622571MaRDI QIDQ2227973

Karen Gunderson, Amy Shaw, Anthony Bonato

Publication date: 16 February 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.05642

zbMATH Keywords

densityextremal combinatoricsgraph burning

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Infinite graphs (05C63) Density (toughness, etc.) (05C42)

Related Items (7)

Surviving rate of graphs and firefighter problem ⋮ A survey of graph burning ⋮ Parameterized complexity of graph burning ⋮ Parameterized Complexity of Graph Burning ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Improved bounds for burning fence graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On slowly percolating sets of minimal size in bootstrap percolation
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• Contact interactions on a lattice
• Bounds on the burning number
• An upper bound on the burning number of graphs
• Burning graphs: a probabilistic perspective
• Approximation algorithms for graph burning
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph is hard
• Burning a Graph as a Model of Social Contagion
• The Surviving Rate of a Graph for the Firefighter Problem
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• How to Burn a Graph

This page was built for publication: Burning the plane. Densities of the infinite Cartesian grid