[1]
O. Cooley, M. Kang, and C. Koch, “Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs”, Electron. J. Combin., vol. 23, no. 2, p. P2.48, Jun. 2016.