Weak saturation in graphs: a combinatorial approach

DOI10.1016/J.JCTB.2024.12.007MaRDI QIDQ7006419zbMATH OpenFDO

Authors Nikolai Terekhov, M. E. Zhukovskii

Publication date 28 March 2025

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.12.007

zbMATH Keywords

bootstrap percolationweak saturation

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites work

• An extremal problem for sets with applications to graph theory
• An extremal problem for two families of sets
• Asymptotic growth of sparse saturated structures is locally determined
• scientific article; zbMATH DE number 3920492 (Why is no real title available?)
• scientific article; zbMATH DE number 3561367 (Why is no real title available?)
• scientific article; zbMATH DE number 3275275 (Why is no real title available?)
• Hyperconnectivity of graphs
• Stretched exponential fixation in stochastic Ising models at zero temperature
• Weak saturation numbers for multiple copies
• Weak saturation numbers for sparse graphs
• Weak saturation stability
• Zero-temperature Glauber dynamics on \({\mathbb{Z}^d}\)

Cited in

(3)

• Weak saturation numbers for the union of disjoint graphs
• A note on weak saturation number of trees
• A short proof of Tuza's conjecture for weak saturation in hypergraphs

This page was built for publication: Weak saturation in graphs: a combinatorial approach

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