Sparse Graphs Are Not Flammable

DOI10.1137/120876113zbMath1285.05124arXiv1201.0723OpenAlexW2049349022MaRDI QIDQ5408614

Paweł Prałat

Publication date: 10 April 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random regular graphssurviving ratefirefighter

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games on graphs (graph-theoretic aspects) (05C57) Density (toughness, etc.) (05C42)

Related Items (11)

The 2-surviving rate of planar graphs without 5-cycles ⋮ Surviving rate of graphs and firefighter problem ⋮ Fighting constrained fires in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Firefighting on square, hexagonal, and triangular grids ⋮ Planar graph is on fire ⋮ Planar graphs without chordal 5-cycles are 2-good ⋮ Burning graphs: a probabilistic perspective ⋮ Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly ⋮ Asymptotic surviving rate of trees with multiple fire sources

This page was built for publication: Sparse Graphs Are Not Flammable