APA (7th ed.) Citation

Allen, P., Koch, C., Parczyk, O., & Person, Y. (2021). Finding tight Hamilton cycles in random hypergraphs faster. Combinatorics, probability & computing, 30(2), 239-257. https://doi.org/10.1017/S0963548320000450

Chicago Style (17th ed.) Citation

Allen, Peter, Christoph Koch, Olaf Parczyk, and Yury Person. "Finding Tight Hamilton Cycles in Random Hypergraphs Faster." Combinatorics, Probability & Computing 30, no. 2 (2021): 239-257. https://doi.org/10.1017/S0963548320000450.

MLA (9th ed.) Citation

Allen, Peter, et al. "Finding Tight Hamilton Cycles in Random Hypergraphs Faster." Combinatorics, Probability & Computing, vol. 30, no. 2, 2021, pp. 239-257, https://doi.org/10.1017/S0963548320000450.