Corrigendum to ``Counting connected graphs inside-out'' [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)]
type: Item
instance of: scholarly article
title: Corrigendum to ``Counting connected graphs inside-out'' [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)]
zbMATH Open document ID: 1178.05052
author: Nicholas Wormald
author: Boris Pittel
published in: Journal of Combinatorial Theory. Series B
publication date: 2008-07-24T00:00:00Z
review text: The proof of Theorem 2 of the original paper is corrected. The previous proof just covers the case \(m=O(n)\) where \(n\) is the number of vertices and \(m\) the number of edges of the graph whereas the full range \(m=O(n \ln n)\) must be covered.
reviewed by: Arnfried Kemnitz
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05A16
zbMATH DE Number: 5303731
MaRDI profile type: Publication
full work available at URL: j.jctb.2007.10.005
OpenAlex ID: W161675474
cites work: Central and local limit theorems applied to asymptotic enumeration
cites work: Asymptotic enumeration of sparse graphs with a minimum degree constraint
cites work: Counting connected graphs inside-out
DOI: 10.1016/J.JCTB.2007.10.005
description: scientific article; zbMATH DE number 5303731