Author:
Cooley Oliver,Kang Mihyun,Zalla Julian
Publisher
Springer International Publishing
Reference9 articles.
1. Cooley, O., Garbe, F., Hng, E.K., Kang, M., Sanhueza-Matamala, N., Zalla, J.: Longest paths in random hypergraphs. arxiv:2003.14143, [v3] (2020)
2. Dudek, A., Frieze, A.: Loose Hamilton cycles in random uniform hypergraphs. Electron. J. Comb. 18(1), Research Paper P48
3. Gao, P.: The stripping process can be slow: Part II. SIAM J. Discret. Math. 32(2), 1159–1188 (2018)
4. Kemkes, G., Wormald, N.: An improved upper bound on the length of the longest cycle of a supercritical random graph. SIAM J. Discret. Math. 27(1), 342–362 (2013)
5. Kim, J.H.: Poisson cloning model for random graphs. In: International Congress of Mathematicians, vol. III, pp. 873–897. European Mathematical Society, Zürich (2006)