The size of the giant high-order component in random hypergraphs

Oliver Cooley, Mihyun Kang, Christoph Koch 0006. The size of the giant high-order component in random hypergraphs. Random Struct. Algorithms, 53(2):238-288, 2018. [doi]

@article{CooleyKK18,
  title = {The size of the giant high-order component in random hypergraphs},
  author = {Oliver Cooley and Mihyun Kang and Christoph Koch 0006},
  year = {2018},
  doi = {10.1002/rsa.20761},
  url = {https://doi.org/10.1002/rsa.20761},
  researchr = {https://researchr.org/publication/CooleyKK18},
  cites = {0},
  citedby = {0},
  journal = {Random Struct. Algorithms},
  volume = {53},
  number = {2},
  pages = {238-288},
}