Cooley, O., Kang, M., & Koch, C. (2016). Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs. The Electronic Journal of Combinatorics, 23(2), P2.48. https://doi.org/10.37236/5064