Saturation in the Hypercube and Bootstrap Percolation

DOI10.1017/S0963548316000122zbMath1371.05145arXiv1408.5488MaRDI QIDQ5366935

Jonathan A. Noel, Natasha Morrison, Alexander D. Scott

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

minimum number of edgesweak saturation of cycles in the grid

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal combinatorics (05D99)

Related Items (9)

Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box ⋮ Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph ⋮ On the running time of hypergraph bootstrap percolation ⋮ Rainbow Saturation for Complete Graphs ⋮ The \(Q_2\)-free process in the hypercube ⋮ Extremal bounds for bootstrap percolation in the hypercube ⋮ Partite Saturation of Complete Graphs ⋮ A sharp threshold for bootstrap percolation in a random hypergraph ⋮ Extremal bounds for bootstrap percolation in the hypercube

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On saturated \(k\)-Sperner systems
• Linear algebra and bootstrap percolation
• A survey of minimum saturated graphs
• Bootstrap percolation on the hypercube
• An extremal theorem in the hypercube
• An extremal problem for sets with applications to graph theory
• Hyperconnectivity of graphs
• Asymptotic growth of sparse saturated structures is locally determined
• Cycle-saturated graphs of minimum size
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Weakly Saturated Hypergraphs and Exterior Algebra
• All minimum C5-saturated graphs
• Hexagon-free subgraphs of hypercubes
• Graph bootstrap percolation
• On 14-Cycle-Free Subgraphs of the Hypercube
• Minimum C₅‐saturated graphs
• Subgraphs of a hypercube containing no small even cycles
• On the maximum number of edges in a c₄‐free subgraph of q_n
• Error Detecting and Error Correcting Codes
• Cycle-Saturated Graphs with Minimum Number of Edges
• A Problem in Graph Theory
• On even-cycle-free subgraphs of the hypercube
• Constructive upper bounds for cycle-saturated graphs of minimum size

This page was built for publication: Saturation in the Hypercube and Bootstrap Percolation