The size of the giant high-order component in random hypergraphs

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)238
Number of pages288
JournalRandom structures & algorithms
Volume53
DOIs
Publication statusPublished - 2018

Fields of Expertise

  • Information, Communication & Computing

Cite this

The size of the giant high-order component in random hypergraphs. / Cooley, Oliver Josef Nikolaus; Kang, Mihyun; Koch, Christoph Jörg.

In: Random structures & algorithms, Vol. 53, 2018, p. 238.

Research output: Contribution to journalArticleResearchpeer-review

@article{604818b9f87e466592c0444147eac7b1,
title = "The size of the giant high-order component in random hypergraphs",
author = "Cooley, {Oliver Josef Nikolaus} and Mihyun Kang and Koch, {Christoph J{\"o}rg}",
year = "2018",
doi = "10.1002/rsa.20761",
language = "English",
volume = "53",
pages = "238",
journal = "Random structures & algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",

}

TY - JOUR

T1 - The size of the giant high-order component in random hypergraphs

AU - Cooley, Oliver Josef Nikolaus

AU - Kang, Mihyun

AU - Koch, Christoph Jörg

PY - 2018

Y1 - 2018

U2 - 10.1002/rsa.20761

DO - 10.1002/rsa.20761

M3 - Article

VL - 53

SP - 238

JO - Random structures & algorithms

JF - Random structures & algorithms

SN - 1042-9832

ER -