Primitive one-factorizations and the geometry of mixed translations (Q2470437): Difference between revisions

There is a straightforward correspondence between one-factorizations of the complete graph \(K_v\), for \(v\) even, and certain permutation sets of degree \(v\). Namely, if a one-factorization of \(K_v\) is given, then the fixed-point-free involutions naturally arising from the one-factors together with the identity form a sharply transitive permutation set of degree \(v\). Conversely, if a sharply transitive permutation set of even degree \(v\) is given, which consists of the identity and \(v-1\) fixed-point-free involutions, then a one-factorization of \(K_v\) is obtained. \noindent The doubly transitive one-factorizations of complete graphs are classified in [\textit{P. J. Cameron} and \textit{G. Korchmàros}, ''One-factorizations of complete graphs with a doubly transitive automorphism group'', Bull. Lond. Math. Soc. 25, 1--6 (1993; Zbl 0795.05069)]. In the present paper the authors address the question of whether primitive one-factorizations of \(K_v\) exist which are not doubly transitive. It is shown that for infinitely many values of \(v\) such one-factorizations can be constructed. Moreover, new examples of one-factorizations are constructed in which every one-factor, when treated as a permutation, is an automorphism of the one-factorization. The latter examples are constructed using the notion of a ''mixed translation''.