Long running times for hypergraph bootstrap percolation

DOI10.1016/j.ejc.2023.103783zbMath1525.05138arXiv2209.02015OpenAlexW4385611304MaRDI QIDQ6057454

Alberto Espuny Díaz, Barnabás Janzer, Gal Kronenberg, Joanna Lada

Publication date: 25 October 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraph bootstrap percolation processmaximum possible running time

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Extremal combinatorics (05D99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On slowly percolating sets of minimal size in bootstrap percolation
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• On the maximum running time in graph bootstrap percolation
• An extremal problem for sets with applications to graph theory
• Hyperconnectivity of graphs
• An extremal problem for two families of sets
• Weak saturation numbers of complete bipartite graphs in the clique
• Exact bounds for some hypergraph saturation problems
• Weakly Saturated Hypergraphs and Exterior Algebra
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• The time of graph bootstrap percolation
• On generalized graphs
• Weakly saturated hypergraphs and a conjecture of Tuza
• Uniform families and count matroids
• On the running time of hypergraph bootstrap percolation

This page was built for publication: Long running times for hypergraph bootstrap percolation