Timeline for Asymptotic formula for the number of connected graphs
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 3, 2019 at 16:25 | comment | added | Slava Rychkov | It's Example II.15, not 11.15 | |
| Jul 1, 2019 at 18:13 | vote | accept | Aidan Rocke | ||
| Jul 1, 2019 at 16:04 | history | edited | Aidan Rocke |
there is a strong connection here to random graphs
|
|
| Jun 30, 2019 at 13:33 | history | edited | Aidan Rocke | CC BY-SA 4.0 |
clarified my hypothesis
|
| Jun 30, 2019 at 8:21 | history | edited | Aidan Rocke | CC BY-SA 4.0 |
improved question title
|
| Jun 30, 2019 at 5:37 | comment | added | Gerry Myerson | Number of connected labeled graphs with n nodes is tabulated, with many links and references, at oeis.org/A001187 | |
| Jun 30, 2019 at 0:37 | answer | added | Aidan Rocke | timeline score: 1 | |
| Jun 27, 2019 at 17:42 | comment | added | Richard Stanley | According to Example 11.15 in Flajolet and Sedgewick, Analytic Combinatorics, the number $K_n$ of labeled connected graphs on $n$ vertices satisfies $K_n=2^{{n\choose 2}}(1-2n2^{-n}+o(2^{-n}))$. | |
| Jun 27, 2019 at 16:27 | history | asked | Aidan Rocke | CC BY-SA 4.0 |