We consider one–factorizations of complete graphs which possess an automorphism group fixing k ≥ 0 vertices and acting regularly (i.e., sharply transitively) on the others. Since the cases k = 0 and k = 1 are well known in literature, we study the case k>=2 in some detail. We prove that both k and the order of the group are even and the group necessarily contains k − 1 involutions. Constructions for some classes of groups are given. In particular we extend the result of [7]: let G be an abelian group of even order and with k − 1 involutions, a one–factorization of a complete graph admitting G as an automorphism group fixing k vertices and acting regularly on the others can be constructed
The existence of 1-factorizations of an infinite complete equipartite graph (Formula presented.) (wi...
We consider 2-factorizations of complete graphs that possess an automorphism group fixing k≥0 vertic...
An automorphism group G of a 1-factorization of the complete multipartite graph Km×n consists of per...
We consider one–factorizations of complete graphs which possess an automorphism group fixing k ≥ 0 v...
AbstractExtending a result by Hartman and Rosa (1985, Europ. J. Combinatorics 6, 45–48), we prove th...
Extending a result by A. Hartman and A. Rosa [European J. Combin. 6 (1985), no. 1, 45--48], we prove...
Given a finite group G of even order, which graphs T have a 1-factorization admitting G as an automo...
For which groups G of even order 2n does a 1-factorization of the complete graph on 2n veritces exis...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
For each finitely generated abelian group G, we construct a 1-factorization of the countable complet...
A 1-factorization of a complete graph is said to be regular if it admits an automorphism group with ...
AbstractFor each finitely generated abelian infinite group G, we construct a 1-factorization of the ...
It is shown that a 1-factorization of Kn with a doubly transitive automorphism group on vertices is ...
A survey on the state of art on the problem of constructing one-factorizations of complete graph whi...
Let F be a one–factorization of K_2m and let H be an automorphism group of F acting sharply transiti...
The existence of 1-factorizations of an infinite complete equipartite graph (Formula presented.) (wi...
We consider 2-factorizations of complete graphs that possess an automorphism group fixing k≥0 vertic...
An automorphism group G of a 1-factorization of the complete multipartite graph Km×n consists of per...
We consider one–factorizations of complete graphs which possess an automorphism group fixing k ≥ 0 v...
AbstractExtending a result by Hartman and Rosa (1985, Europ. J. Combinatorics 6, 45–48), we prove th...
Extending a result by A. Hartman and A. Rosa [European J. Combin. 6 (1985), no. 1, 45--48], we prove...
Given a finite group G of even order, which graphs T have a 1-factorization admitting G as an automo...
For which groups G of even order 2n does a 1-factorization of the complete graph on 2n veritces exis...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
For each finitely generated abelian group G, we construct a 1-factorization of the countable complet...
A 1-factorization of a complete graph is said to be regular if it admits an automorphism group with ...
AbstractFor each finitely generated abelian infinite group G, we construct a 1-factorization of the ...
It is shown that a 1-factorization of Kn with a doubly transitive automorphism group on vertices is ...
A survey on the state of art on the problem of constructing one-factorizations of complete graph whi...
Let F be a one–factorization of K_2m and let H be an automorphism group of F acting sharply transiti...
The existence of 1-factorizations of an infinite complete equipartite graph (Formula presented.) (wi...
We consider 2-factorizations of complete graphs that possess an automorphism group fixing k≥0 vertic...
An automorphism group G of a 1-factorization of the complete multipartite graph Km×n consists of per...