The size of the giant component in random hypergraphs: a short proof (bibtex)

by Oliver Cooley, Mihyun Kang and Christoph Koch

Reference:

Oliver Cooley, Mihyun Kang and Christoph Koch, The size of the giant component in random hypergraphs: a short proof, Electronic Journal of Combinatorics, 26, #3.6:1–17, (2019).

Bibtex Entry:

@Article{CooleyEtAl2019b,
  arxiv   = {1803.02809},
  author  = {Cooley, Oliver and Kang, Mihyun and Koch, Christoph},
  journal = {Electronic Journal of Combinatorics},
  title   = {The size of the giant component in random hypergraphs: a short proof},
  year    = {2019},
  oatype  = {Gold},
  pages   = {{\#}3.6:1--17},
  volume  = {26},
  doi     = {10.37236/7712},
  groups  = {Project15 (Kang), Faculty, Student},
}