Timeline for Groups as automorphism groups of small graphs and the number of rigid graphs of a given size
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 18, 2022 at 13:26 | comment | added | Martin Sleziak | In case somebody stumbles upon this, I will add a link to the older question: Realizing groups as automorphism groups of graphs. (The accepted answer contains working links to the two papers.) | |
| Sep 1, 2010 at 17:09 | vote | accept | Stefan Geschke | ||
| Sep 1, 2010 at 17:02 | answer | added | Simon Thomas | timeline score: 7 | |
| Sep 1, 2010 at 15:29 | answer | added | David Eppstein | timeline score: 2 | |
| Sep 1, 2010 at 14:51 | history | edited | Stefan Geschke | CC BY-SA 2.5 |
Explained rigidity in the question
|
| Sep 1, 2010 at 14:49 | comment | added | Stefan Geschke | A rigid graph is a graph whose only automorphism is the identity. I added this to the question. | |
| Sep 1, 2010 at 14:40 | comment | added | Keivan Karai | what do you mean by a rigid graph? | |
| Sep 1, 2010 at 14:34 | history | asked | Stefan Geschke | CC BY-SA 2.5 |