We locate the critical threshold at which it becomes likely that the complete graph can be obtained from the Erdős–Rényi graph by iteratively completing copies of minus an edge. This refines work of Balogh, Bollobás and Morris that bounds the threshold up to multiplicative constants.
The author gratefully acknowledges the financial support of NSERC of Canada, and thanks Omer Angel for many helpful discussions.
"The sharp -percolation threshold on the Erdős–Rényi random graph." Electron. J. Probab. 27 1 - 23, 2022. https://doi.org/10.1214/21-EJP710