The maximal running time of hypergraph bootstrap percolation

DOI10.1137/22M151995XzbMATH Open1539.0511MaRDI QIDQ6542539FDOQ6542539

Authors: Ivailo Hartarsky, Lyuben Lichev 

Publication date: 22 May 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Recommendations

• On the running time of hypergraph bootstrap percolation
• Long running times for hypergraph bootstrap percolation
• On the maximum running time in graph bootstrap percolation
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box

zbMATH Keywords

bootstrap percolationcomplete hypergraphmaximal running time

Mathematics Subject Classification ID

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

Cites Work

• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• On the maximum running time in graph bootstrap percolation
• Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box
• Long running times for hypergraph bootstrap percolation
• On the running time of hypergraph bootstrap percolation

Cited In (1)

• Long running times for hypergraph bootstrap percolation

This page was built for publication: The maximal running time of hypergraph bootstrap percolation

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