Timeline for Factors of Kneser graph
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 22, 2013 at 21:36 | vote | accept | Turbo | ||
| Oct 22, 2013 at 21:22 | comment | added | Chris Godsil | The Doerfler-Imrich paper is 1969, and in German. The Feigenbaum-Schaeffer paper comes up on google. There is nothing useful to be said about the relation between the automorphism group of a graph and a subgraph. | |
| Oct 22, 2013 at 20:50 | comment | added | Turbo | Could you link the paper as well? So it all boils down to finding if the automorphism group is a direct or a wreath product? Could arguments such ones here also answer the following question? Given vertex transitive $G$ and $H$ such that $|\mathcal{V}(G)|<|\mathcal{V}(H)|$ and $\mathcal{Aut}(G)\supset\mathcal{Aut}(H)$, is it true $G\leq H$? Conversely if $G\leq H$, what can we say about $\mathcal{Aut}(G)$ and $\mathcal{Aut}(H)$? | |
| Oct 22, 2013 at 15:08 | history | edited | Chris Godsil | CC BY-SA 3.0 |
excluded cases
|
| Oct 22, 2013 at 14:00 | comment | added | Brendan McKay | I'm sure this proof works, but it needs a bit more. A complete graph (which is a Kneser graph) on a non-prime number of vertices is a strong product but your argument would exclude it. The Kneser graph $K_{n;n/2}$ is also a strong product I think. | |
| Oct 22, 2013 at 12:16 | history | answered | Chris Godsil | CC BY-SA 3.0 |