Timeline for Vertex transitive graphs
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 19, 2013 at 6:21 | vote | accept | Turbo | ||
| Apr 2, 2012 at 20:31 | comment | added | Turbo | There are not that many scvt graphs out there for a prescribed graph size!! | |
| Apr 2, 2012 at 20:29 | comment | added | Turbo | @BrendanMcKay Could you elaborate? I also felt it is feasible especially if the graph is self-complementary as well. | |
| Apr 2, 2012 at 19:35 | comment | added | Chris Godsil | Certainly, in a particular case transitivity can make a big difference. But I was thinking of theorems running "if $G$ is vertex transitive, then..." | |
| Apr 2, 2012 at 19:33 | history | edited | Chris Godsil | CC BY-SA 3.0 |
fixed typo
|
| Apr 2, 2012 at 12:41 | comment | added | Brendan McKay | In practice, knowing the automorphism group can help a lot, especially if the group is large, since you can remove parts of the search space equivalent to parts you have done already. In the case of very difficult problems, this can make the difference between finishing it or not. | |
| Apr 2, 2012 at 3:43 | vote | accept | Turbo | ||
| Apr 2, 2012 at 20:29 | |||||
| Apr 2, 2012 at 3:19 | comment | added | Chris Godsil | My recollection is that it does not. (You could check the paper.) | |
| Apr 2, 2012 at 1:07 | comment | added | Turbo | Does the result hold if we restrict to those graphs that have exactly n(n-1)/4 edges (n is 0 or 1 mod 4) which is half the maximum (half a complete graph)? | |
| Apr 1, 2012 at 21:53 | history | answered | Chris Godsil | CC BY-SA 3.0 |