Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs

Oliver Cooley, Mihyun Kang, Christoph Koch 0006. Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs. Electr. J. Comb., 23(2):2, 2016. [doi]

@article{CooleyKK16,
  title = {Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs},
  author = {Oliver Cooley and Mihyun Kang and Christoph Koch 0006},
  year = {2016},
  url = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p48},
  researchr = {https://researchr.org/publication/CooleyKK16},
  cites = {0},
  citedby = {0},
  journal = {Electr. J. Comb.},
  volume = {23},
  number = {2},
  pages = {2},
}