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