Corrigendum to ``Counting connected graphs inside-out'' [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)] (Q933684)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Corrigendum to ``Counting connected graphs inside-out [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)] |
scientific article; zbMATH DE number 5303731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Corrigendum to ``Counting connected graphs inside-out'' [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)] |
scientific article; zbMATH DE number 5303731 |
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
0.7932875752449036
0 references
0.7894516587257385
0 references
0.7655190825462341
0 references
0.7606945037841797
0 references
0.7548046112060547
0 references
