High-order bootstrap percolation in hypergraphs

MaRDI QIDQ6389016zbMATH OpenFDO

Authors Oliver Cooley, Julian Zalla

Publication date 24 January 2022

Mathematics Subject Classification ID

Hypergraphs (05C65)

Abstract: Motivated by the bootstrap percolation process for graphs, we define a new, high-order generalisation to $k$-uniform hypergraphs, in which we infect $j$-sets of vertices for some integer $1lejlek-1$. We investigate the smallest possible size of an initially infected set which ultimately percolates and determine the exact size in almost all cases of $k$ and $j$.

This page was built for publication: High-order bootstrap percolation in hypergraphs

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