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

Oliver Cooley, Mihyun Kang, Christoph Koch (2018)

> Home

Details and statistics

DOI: 10.1002/RSA.20761

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/CooleyKK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/CooleyKK18
Oliver Cooley, Mihyun Kang, Christoph Koch:
The size of the giant high-order component in random hypergraphs. Random Struct. Algorithms 53(2): 238-288 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.