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
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jctb.2007.10.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W161675474 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Central and local limit theorems applied to asymptotic enumeration / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Asymptotic enumeration of sparse graphs with a minimum degree constraint / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting connected graphs inside-out / rank | |||
Normal rank | |||
Latest revision as of 12:45, 28 June 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
