Longest paths in random hypergraphs (bibtex)

by Oliver Cooley, Frederik Garbe, Eng Keat Hng, Mihyun Kang, Nicolás Sanhueza-Matamala and Julian Zalla

Reference:

Oliver Cooley, Frederik Garbe, Eng Keat Hng, Mihyun Kang, Nicolás Sanhueza-Matamala and Julian Zalla, Longest paths in random hypergraphs, SIAM J. Discrete Math., 35(4), 2430–2458, (2021).

Bibtex Entry:

@Article{CooleyEtAl2021a,
  arxiv     = {2003.14143},
  author    = {Cooley, Oliver and Garbe, Frederik and Hng, Eng Keat and Kang, Mihyun and Sanhueza-Matamala, Nicol\'{a}s and Zalla, Julian},
  journal   = {SIAM J. Discrete Math.},
  title     = {Longest paths in random hypergraphs},
  year      = {2021},
  issn      = {0895-4801},
  number    = {4},
  pages     = {2430--2458},
  volume    = {35},
  doi       = {10.1137/20M1345712},
  fjournal  = {SIAM Journal on Discrete Mathematics},
  groups    = {Project15 (Kang), Faculty, Student, External},
  mrnumber  = {4325741},
  xxmrclass = {05C80 (05C38 05C65)},
  xxurl     = {https://doi.org/10.1137/20M1345712},
}