Sharp threshold for K₄-percolation

Abstract: We locate the critical threshold

p_{c}

at which it becomes likely that the complete graph

K_{n}

can be obtained from the ErdH{o}s-R'enyi graph

{c a l G}_{n, p}

by iteratively completing copies of

K_{4}

minus an edge. This refines work of Balogh, Bollob'as and Morris that bounds the threshold up to multiplicative constants.

This page was built for publication: Sharp threshold for $K_4$-percolation