Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly

DOI10.1007/S00373-012-1265-9zbMath1298.05225OpenAlexW2001001176MaRDI QIDQ742585

Paweł Prałat

Publication date: 19 September 2014

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

Full work available at URL: https://doi.org/10.1007/s00373-012-1265-9

zbMATH Keywords

random graphssurviving ratefirefighter

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (10)

Surviving rate of graphs and firefighter problem ⋮ The firefighter problem: empirical results on random graphs ⋮ Fighting constrained fires in graphs ⋮ Unnamed Item ⋮ Firefighting on square, hexagonal, and triangular grids ⋮ Planar graph is on fire ⋮ Burning graphs: a probabilistic perspective ⋮ A lower bound of the surviving rate of a planar graph with girth at least seven ⋮ Firefighting as a Strategic Game ⋮ Asymptotic surviving rate of trees with multiple fire sources

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The surviving rate of an infected network
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Explicit construction of linear sized tolerant networks
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The firefighter problem for graphs of maximum degree three
• Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
• The Surviving Rate of a Graph for the Firefighter Problem
• Expander graphs and their applications
• A proof of alon's second eigenvalue conjecture
• Sparse Graphs Are Not Flammable

This page was built for publication: Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly