Corrigendum 'The asymptotic number of connected d-uniform hypergraphs'

Mihyun Kang, Michael Behrisch, Amin Coja-Oghlan

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)373-375
JournalCombinatorics, Probability & Computing
Volume24
Issue number1
DOIs
Publication statusPublished - 2015

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Theoretical

Cite this

Corrigendum 'The asymptotic number of connected d-uniform hypergraphs'. / Kang, Mihyun; Behrisch, Michael; Coja-Oghlan, Amin.

In: Combinatorics, Probability & Computing, Vol. 24, No. 1, 2015, p. 373-375.

Research output: Contribution to journalArticleResearchpeer-review

Kang, Mihyun ; Behrisch, Michael ; Coja-Oghlan, Amin. / Corrigendum 'The asymptotic number of connected d-uniform hypergraphs'. In: Combinatorics, Probability & Computing. 2015 ; Vol. 24, No. 1. pp. 373-375.
@article{fa9757fb0fe34fc9aaa8cd32fce70492,
title = "Corrigendum 'The asymptotic number of connected d-uniform hypergraphs'",
author = "Mihyun Kang and Michael Behrisch and Amin Coja-Oghlan",
year = "2015",
doi = "doi:10.1017/S0963548314000698",
language = "English",
volume = "24",
pages = "373--375",
journal = "Combinatorics, Probability & Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "1",

}

TY - JOUR

T1 - Corrigendum 'The asymptotic number of connected d-uniform hypergraphs'

AU - Kang, Mihyun

AU - Behrisch, Michael

AU - Coja-Oghlan, Amin

PY - 2015

Y1 - 2015

U2 - doi:10.1017/S0963548314000698

DO - doi:10.1017/S0963548314000698

M3 - Article

VL - 24

SP - 373

EP - 375

JO - Combinatorics, Probability & Computing

JF - Combinatorics, Probability & Computing

SN - 0963-5483

IS - 1

ER -