When is the binomial random graph G(n,p) likely to contain a collection of vertex-disjoint triangles that contains every vertex? This question has had a good answer since the work of Johansson, Kahn and Vu in 2008, with an alternative proof following shortly via the results of Frankston, Kahn, Narayanan and Park in 2021. I will give a new alternative proof and hint at potential developments.