Timeline for An upper bound for the number of non-isomorphic graphs having exactly $m$ edges and no isolated vertices
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 18, 2018 at 0:55 | vote | accept | abcd | ||
| May 18, 2018 at 0:55 | vote | accept | abcd | ||
| May 18, 2018 at 0:55 | |||||
| May 18, 2018 at 0:55 | vote | accept | abcd | ||
| May 18, 2018 at 0:55 | |||||
| Apr 23, 2018 at 13:09 | comment | added | Max Alekseyev | Some initial counts are listed in oeis.org/A000664 | |
| Apr 22, 2018 at 2:11 | answer | added | Brendan McKay | timeline score: 3 | |
| Apr 22, 2018 at 0:37 | answer | added | Jan Kyncl | timeline score: 3 | |
| Apr 21, 2018 at 20:28 | comment | added | abcd | Sorry, forgot to mention that the proof/counterexample should be given for all but finitely many $m$, not for any fixed $m$. | |
| Apr 21, 2018 at 20:27 | review | First posts | |||
| Apr 21, 2018 at 20:37 | |||||
| Apr 21, 2018 at 20:24 | history | asked | abcd | CC BY-SA 3.0 |