Evolution of high-order connected components in random hypergraphs

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publicationProceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15)
PublisherElectronic Notes in Discrete Mathematics
Pages569-575
Publication statusPublished - 2015
EventEuropean Conference on Combinatorics, Graph Theory and Applications - Bergen, Norway
Duration: 31 Aug 20154 Sep 2015

Conference

ConferenceEuropean Conference on Combinatorics, Graph Theory and Applications
Abbreviated titleEUROCOMB
CountryNorway
CityBergen
Period31/08/154/09/15

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Cite this

Kang, M., Cooley, O. J. N., & Koch, C. J. (2015). Evolution of high-order connected components in random hypergraphs. In Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb15) (pp. 569-575). Electronic Notes in Discrete Mathematics.