Cooley, O., Kang, M., & Koch, C. (2019). The Size of the Giant Component in Random Hypergraphs: a Short Proof. The Electronic Journal of Combinatorics, 26(3), P3.6. https://doi.org/10.37236/7712