Timeline for Is the Poset of Graphs Automorphism-free?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 21 at 2:18 | comment | added | Daniel Donnelly | Probably has something to do with: math.stackexchange.com/questions/3052384/… | |
| Dec 31, 2013 at 11:48 | comment | added | domotorp | Of course there is in fact no need to check, as it anyhow follows from the set edge reconstruction conjecture but I could not find anything about for what values that has been checked. | |
| Dec 31, 2013 at 6:30 | comment | added | Wade Hann-Caruthers | $\mathcal P_5$ can pretty easily be checked by hand. As for anything larger, I'm not sure. | |
| Dec 31, 2013 at 5:46 | comment | added | domotorp | Maybe it is useful to add that $\cal P_4$ has a nontrivial automorphism. Did you ckeck for higher values, e.g. using the tables from maths.uq.edu.au/~pa/research/posets4to8.html? | |
| Dec 31, 2013 at 4:40 | review | First posts | |||
| Dec 31, 2013 at 4:56 | |||||
| Dec 31, 2013 at 4:23 | history | asked | Wade Hann-Caruthers | CC BY-SA 3.0 |