Cooley, Oliver, Mihyun Kang, and Christoph Koch. “Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs”. The Electronic Journal of Combinatorics 23, no. 2 (June 10, 2016): P2.48. Accessed April 4, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p48.