Résumé : On a graph $G$, we consider the bootstrap model: some vertices are infected and any vertex with 2 infected vertices becomes infected. We identify the location of the threshold for the event that the Erdos-Renyi graph $G(n,p)$ can be fully infected by a seed of only two infected vertices. Joint work with Brett Kolesnik.