Corrigendum to ``Counting connected graphs inside-out'' [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)] (Q933684): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1296593 |
Changed an Item |
||
| Property / author | |||
| Property / author: Boris G. Pittel / rank | |||
Normal rank | |||
Revision as of 17:42, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Corrigendum to ``Counting connected graphs inside-out'' [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)] |
scientific article |
Statements
Corrigendum to ``Counting connected graphs inside-out'' [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)] (English)
0 references
24 July 2008
0 references
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.
0 references
