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

Mihyun Kang, Michael Behrisch, Amin Coja-Oghlan

Publikation: Beitrag in einer Fachzeitschrift › Artikel › Begutachtung

Originalsprache	englisch
Seiten (von - bis)	373-375
Fachzeitschrift	Combinatorics, Probability & Computing
Jahrgang	24
Ausgabenummer	1
DOIs	https://doi.org/doi:10.1017/S0963548314000698
Publikationsstatus	Veröffentlicht - 2015

Fields of Expertise

@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 = "1469-2163",

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

SN - 1469-2163

VL - 24

SP - 373

EP - 375

JO - Combinatorics, Probability & Computing

JF - Combinatorics, Probability & Computing

IS - 1

ER -