On 2-factorizations whose automorphism group acts doubly transitively on the factors (Q2470464)

A 2-factorization of the complete graph \(K_n\) (\(n\) odd) is a set \({\mathfrak F}\) of edge-disjoint 2-factors partitioning the edge set of the graph. A 2-factorization is called Hamiltonian if each 2-factor consists of a single cycle. Let \(\Aut({\mathfrak F})\) denote the group of all permutations of the vertex set of \(K_n\) whose extended actions on cycles preserve the 2-factorization \({\mathfrak F}\). The author considers the case, that \(\Aut({\mathfrak F})\) acts doubly transitively on the factors. Some classes of examples and some necessary conditions for the existence of such factorizations are given. In the Hamiltonian case, the only possibility is the unique 2-factorization of \(K_5\).