'The Asymptotic Number of Connected d-Uniform Hypergraphs' (vol 23, pg 367, 2014)

作者：Behrisch Michael^*; Coja Oghlan Amin; Kang Mihyun

来源：Combinatorics Probability & Computing, 2015, 24(1): 373-375.

DOI：10.1017/S0963548314000698

<jats:p>The authors would like to rectify a mistake made in Theorem 1.1 of their article (Behrisch, Cojaa-Oghlan &amp; Kang 2014), published in issue 23 (3). The text below explains the changes required.</jats:p>

• 出版日期2015-1