Cooley, O., M. Kang, and C. Koch. “Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs”. The Electronic Journal of Combinatorics, Vol. 23, no. 2, June 2016, p. P2.48, doi:10.37236/5064.