A cube dismantling problem related to bootstrap percolation

DOI10.1007/s10955-012-0622-7zbMath1260.82042OpenAlexW2057644718MaRDI QIDQ1938846

János Barát, Ian M. Wanless

Publication date: 25 February 2013

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10955-012-0622-7

zbMATH Keywords

greedy algorithmLatin squaregraph decompositionbootstrap percolationLatin hypercube

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Percolation (82B43)

Cites Work

• Unnamed Item
• The weak 3-flow conjecture and the weak circular flow conjecture
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• Bootstrap percolation in living neural networks
• The metastability threshold for modified bootstrap percolation in \(d\) dimensions
• Bootstrap percolation and kinetically constrained models on hyperbolic lattices
• Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
• Minimal percolating sets in bootstrap percolation
• The real truth about star designs
• On the number of Latin squares
• The cycle structure of two rows in a random Latin square
• A Census of Small Latin Hypercubes
• Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Random disease on the square grid
• Claw‐decompositions and tutte‐orientations

This page was built for publication: A cube dismantling problem related to bootstrap percolation