Bootstrap percolation on the Hamming graphs

DOI10.1016/J.DISC.2025.114713MaRDI QIDQ6884433zbMATH OpenFDO

Authors Meysam Miralaei, A. Mohammadian, B. Tayfeh-Rezaie

Publication date 15 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114713

zbMATH Keywords

bootstrap percolationHamming graphpercolating set

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial probability (60C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites work

• Bootstrap percolation in high dimensions
• Bootstrap percolation on the hypercube
• Contagious sets in random graphs
• Extremal bounds for bootstrap percolation in the hypercube
• Graph bootstrap percolation
• scientific article; zbMATH DE number 3275275 (Why is no real title available?)
• Largest and smallest minimal percolating sets in trees
• Line percolation
• Linear algebra and bootstrap percolation
• Lower bounds for graph bootstrap percolation via properties of polynomials
• On a packing and covering problem
• Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs
• Theory of self-reproducing automata. Edited and completed by Arthur W. Burks
• Weak saturation numbers of complete bipartite graphs in the clique

This page was built for publication: Bootstrap percolation on the Hamming graphs

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