Timeline for Generate all non-isomorphic partitions $\pi = \{ \{1, ..., n-1\}, \{n\} \}$ for all graphs of order $n$
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 24, 2015 at 8:30 | vote | accept | Dominik Sieber | ||
| Jun 24, 2015 at 8:30 | vote | accept | Dominik Sieber | ||
| Jun 24, 2015 at 8:30 | |||||
| Jun 24, 2015 at 8:27 | vote | accept | Dominik Sieber | ||
| Jun 24, 2015 at 8:30 | |||||
| Jun 24, 2015 at 0:56 | review | Close votes | |||
| Jun 24, 2015 at 7:22 | |||||
| Jun 24, 2015 at 0:31 | answer | added | Gordon Royle | timeline score: 2 | |
| Jun 23, 2015 at 22:00 | answer | added | Ira Gessel | timeline score: 5 | |
| Jun 23, 2015 at 19:05 | comment | added | Per Alexandersson | So, you want to count the number of isomorphism classes of connected graphs on $n$ vertices, with one distinguished vertex? | |
| Jun 23, 2015 at 17:06 | comment | added | Ben Barber | Note that these objects are equivalent to ordered partitions of graphs on 1 fewer vertex (up to isomorphism) by taking the neighbours of the distinguished vertex to be the members of the first part. | |
| Jun 23, 2015 at 16:55 | history | edited | Ben Barber | CC BY-SA 3.0 |
embed images
|
| Jun 23, 2015 at 16:24 | comment | added | The Masked Avenger | This sounds like a graph reconstruction problem. What will you do with such a deck (set or multiset) of partitions? | |
| Jun 23, 2015 at 16:09 | review | First posts | |||
| Jun 23, 2015 at 16:20 | |||||
| Jun 23, 2015 at 16:04 | history | asked | Dominik Sieber | CC BY-SA 3.0 |