For which groups G of even order 2n does a 1-factorization of the complete graph on 2n veritces exist with the property of admitting G as a sharply vertex-transitive automorphism group? The complete answer is still unknown. Using the definition of a starter in G introduced in [M. Buratti "Abelian 1-factorizations of the complete graph" Europ. J Comb. 2001, pp.291-295], we give a positive answer for new classes of groups; for example, the nilpotent groups with either an abelian Sylow 2-subgroup or a non-abelian Sylow 2-subgroup which possesses a cyclic subgroup of index 2. Further considerations are given in case the automorphism group G fixes a 1-factor
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
AbstractWe introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-facto...
A survey on the state of art on the problem of constructing one-factorizations of complete graph whi...
Extending a result by A. Hartman and A. Rosa [European J. Combin. 6 (1985), no. 1, 45--48], we prove...
AbstractExtending a result by Hartman and Rosa (1985, Europ. J. Combinatorics 6, 45–48), we prove th...
AbstractExtending a result by Hartman and Rosa (1985, Europ. J. Combinatorics 6, 45–48), we prove th...
AbstractLet S2n be the symmetric group of degree 2n. We give a strong indication to prove the existe...
Let S_2n be the symmetric group of degree 2n. We give a strong indication to prove the existence of ...
For each finitely generated abelian group G, we construct a 1-factorization of the countable complet...
AbstractLet G be a group of order 2t, with t⩾4. We prove a sufficient condition for the existence of...
For each finitely generated abelian group G, we construct a 1-factorization of the countable complet...
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 ...
We introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-factorization...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
AbstractWe introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-facto...
A survey on the state of art on the problem of constructing one-factorizations of complete graph whi...
Extending a result by A. Hartman and A. Rosa [European J. Combin. 6 (1985), no. 1, 45--48], we prove...
AbstractExtending a result by Hartman and Rosa (1985, Europ. J. Combinatorics 6, 45–48), we prove th...
AbstractExtending a result by Hartman and Rosa (1985, Europ. J. Combinatorics 6, 45–48), we prove th...
AbstractLet S2n be the symmetric group of degree 2n. We give a strong indication to prove the existe...
Let S_2n be the symmetric group of degree 2n. We give a strong indication to prove the existence of ...
For each finitely generated abelian group G, we construct a 1-factorization of the countable complet...
AbstractLet G be a group of order 2t, with t⩾4. We prove a sufficient condition for the existence of...
For each finitely generated abelian group G, we construct a 1-factorization of the countable complet...
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 ...
We introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-factorization...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
AbstractWe introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-facto...
A survey on the state of art on the problem of constructing one-factorizations of complete graph whi...