Threshold and hitting time for high-order connectedness in random hypergraphs (bibtex)
by Oliver Cooley, Mihyun Kang, Christoph Koch
Reference:
Oliver Cooley, Mihyun Kang, Christoph Koch, Threshold and hitting time for high-order connectedness in random hypergraphs, Electron. J. Combin., 23(2), Paper 2.48, 14, (2016).
Bibtex Entry:
@article{CooleyKangKoch-hittingtime,
  AUTHOR = {Cooley, Oliver and Kang, Mihyun and Koch, Christoph},
     TITLE = {Threshold and hitting time for high-order connectedness in
              random hypergraphs},
   JOURNAL = {Electron. J. Combin.},
  FJOURNAL = {Electronic Journal of Combinatorics},
    VOLUME = {23},
      YEAR = {2016},
    NUMBER = {2},
     PAGES = {Paper 2.48, 14},
  MRNUMBER = {3512670},
     arxiv = {1502.07289},
       url = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p48},
}