$H$-percolation with a random $H$

Zsolt Bartha, Brett Kolesnik, Gal Kronenberg

In $H$-percolation, we start with an Erdős--Rényi graph ${\mathcal{G}}_{n,p}$ and then iteratively add edges that complete copies of $H$. The process percolates if all edges missing…