Automorphism groups of graphs with 1-factorizations (Q1815305): Difference between revisions

A colouring \(\phi\) of a graph \(G\) is a mapping from the edge set of \(G\) onto a set \(\Phi\) of colours. Proper colourings are characterized by the property that any two adjacent edges receive different colours. A perfect colouring \(\phi\) of \(G\) is a proper colouring, such that for every pair \((v,\alpha)\) of \(V(G)\times \Phi\) there is exactly one edge in \(G\) coloured \(\alpha\) and incident with \(v\). Perfect colourings are also called 1-factorizations. All colour-preserving automorphisms of \(G\) related to \(\phi\) constitute a subgroup \(A_c(G,\phi)\) of \(\Aut(G)\). Theorem 1. Let \(H\) be a finitely generated group. Then there is a connected graph \(G\) of degree 3 with 1-factorization \(\phi\) such that \(A_c(G,\phi)\) is isomorphic to \(H\). Theorem 2. Let \(H\) be a finitely generated group. Then there is a regular graph \(G\) of degree 5 such that every subgroup of \(H\) is isomorphic to a group \(A_c(G,\phi)\) for some 1-factorization \(\phi\) of \(G\).