Threshold and hitting time for high-order connectedness in random hypergraphs (bibtex)

by Oliver Cooley, Mihyun Kang and Christoph Koch

Reference:

Oliver Cooley, Mihyun Kang and Christoph Koch, Threshold and hitting time for high-order connectedness in random hypergraphs, Electronic Journal of Combinatorics, 23, #P2.48:1–14, (2016).

Bibtex Entry:

@Article{CooleyEtAl2016,
  arxiv    = {1502.07289},
  author   = {Cooley, Oliver and Kang, Mihyun and Koch, Christoph},
  journal  = {Electronic Journal of Combinatorics},
  title    = {Threshold and hitting time for high-order connectedness in random hypergraphs},
  year     = {2016},
  oatype   = {Gold},
  pages    = {{\#}P2.48:1--14},
  volume   = {23},
  doi      = {10.37236/5064},
  groups   = {Project15 (Kang), Faculty, Student},
  xxmrnumber = {3512670},
}