Corrigendum to ``Counting connected graphs inside-out [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)]

DOI10.1016/J.JCTB.2007.10.005MaRDI QIDQ933684zbMATH OpenOpenAlexFDO

Authors Nicholas Wormald, Boris Pittel

Publication date 24 July 2008

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2007.10.005

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Random graphs (graph-theoretic aspects) (05C80)

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.

Recommendations

• Corrigendum to: ``The effect on eigenvalues of connected graphs by adding edges
• Corrigendum to: ``The asymptotic number of connected \(d\)-uniform hypergraphs
• Corrigendum to: ``Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees
• Corrigendum to: ``On the enumeration of a class of toroidal graphs
• Letter to the editor. Erratum to: ``Enumeration of labeled block-cactus graphs

Cites work

• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• Central and local limit theorems applied to asymptotic enumeration
• Counting connected graphs inside-out

Cited in

(20)

• Corrigendum to: ``The effect on eigenvalues of connected graphs by adding edges
• Corrigendum to: ``The orthogonal colouring game
• Corrigendum to: ``Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees
• Corrigendum to ``Completeness results for graph isomorphism
• Counting strongly-connected, moderately sparse directed graphs
• Corrigendum to: Secret sharing on infinite graphs
• Corrigendum to our paper ``Birational transformations of weighted graphs
• Corrigendum to: ``On the enumeration of a class of toroidal graphs
• Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439
• scientific article; zbMATH DE number 3966097 (Why is no real title available?)
• Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances
• Correction to: ``Structural cohesion and embeddedness in two-mode networks
• Letter to the editor. Erratum to: ``Enumeration of labeled block-cactus graphs
• Corrigendum to: ``The asymptotic number of connected \(d\)-uniform hypergraphs
• Corrigendum to: ``Log-concavity of some independence polynomials via a partial ordering
• Correction to: ``Sandwiching dense random regular graphs between binomial random graphs
• Corrigendum to: ``Factoring, into edge transpositions of a tree, permutations fixing a terminal vertex
• Corrigendum to: ``On the monophonic rank of a graph
• On z-analogue of Stepanov-Lomonosov-Polesskii inequality
• A short proof of a central limit theorem for the order of the giant component and k-core

This page was built for publication: Corrigendum to ``Counting connected graphs inside-out [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)]

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q933684)