Article contents
‘The Asymptotic Number of Connected d-Uniform Hypergraphs’ — CORRIGENDUM
Published online by Cambridge University Press: 14 October 2014
Extract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
The authors would like to rectify a mistake made in Theorem 1.1 of their article (Behrisch, Cojaa-Oghlan & Kang 2014), published in issue 23 (3). The text below explains the changes required.
- Type
- Corrigendum
- Information
- Combinatorics, Probability and Computing , Volume 24 , Special Issue 1: Honouring the Memory of Philippe Flajolet - Part 3 , January 2015 , pp. 373 - 375
- Copyright
- Copyright © Cambridge University Press 2014
References
[1]
Behrisch, M., Coja-Oghlan, A. and Kang, M. (2014) The asymptotic number of connected d-uniform hypergraphs. Combin. Probab. Comput.
23
367–385.Google Scholar
[2]
Bollobás, B. and Riordan, M. (2014) Counting connected hypergraphs via the probabilistic method. arXiv:1404.5887Google Scholar
[3]
Coja-Oghlan, A., Moore, C. and Sanwalani, V. (2007) Counting connected graphs and hypergraphs via the probabilistic method. Random Struct. Alg.
31
288–329.Google Scholar
This correction applies to the following article(s):
- 2
- Cited by