"The Size of the Giant Component in Random Hypergraphs: a Short Proof."

Oliver Cooley, Mihyun Kang, Christoph Koch (2019)

> Home

Details and statistics

DOI: 10.37236/7712

access: open

type: Journal Article

metadata version: 2025-12-01

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/combinatorics/CooleyK019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/CooleyK019
Oliver Cooley, Mihyun Kang, Christoph Koch:
The Size of the Giant Component in Random Hypergraphs: a Short Proof. Electron. J. Comb. 26(3): 3 (2019)

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.