Cite
APA Citation
Cooley, O., Kang, M., & Koch, C. (2018). the size of the giant high‐order component in random hypergraphs. Random structures & algorithms, 53(2), 238–288. http://access.bl.uk/ark:/81055/vdc_100066550560.0x000030
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Cooley, O., Kang, M., & Koch, C. (2018). the size of the giant high‐order component in random hypergraphs. Random structures & algorithms, 53(2), 238–288. http://access.bl.uk/ark:/81055/vdc_100066550560.0x000030