Let be a 2-factorization of the complete graph Kv admitting an automorphism group G acting doubly transitively on the set of vertices. The vertex-set V(Kv) can then be identified with the point-set of AG(n, p) and each 2-factor of is the union of p-cycles which are obtained from a parallel class of lines of AG(n, p) in a suitable manner, the group G being a subgroup of A G L(n, p) in this case. The proof relies on the classification of 2-(v, k, 1) designs admitting a doubly transitive automorphism group. The same conclusion holds even if G is only assumed to act doubly homogeneously
AbstractWe introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-facto...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
AbstractIf D is a 2-(v, k, 1) design admitting a group G of automorphisms which acts doubly homogene...
Let be a 2-factorization of the complete graph Kv admitting an automorphism group G acting doubly t...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting doubly ...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primiti...
We consider 2-factorizations of the complete graph Kv whose automorphism group is ”rich” in some sen...
It is shown that a 1-factorization of Kn with a doubly transitive automorphism group on vertices is ...
We consider 2-factorizations of complete graphs that possess an automorphism group fixing k≥0 vertic...
Symmetric graph designs, or SGDs, were defined by Gronau et al. as a common generalization of symmet...
We introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-factorization...
AbstractUsing the classification of finite doubly transitive groups the finite two-graphs which admi...
We introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-factorizatio...
AbstractWe introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-facto...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
AbstractIf D is a 2-(v, k, 1) design admitting a group G of automorphisms which acts doubly homogene...
Let be a 2-factorization of the complete graph Kv admitting an automorphism group G acting doubly t...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting doubly ...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primiti...
We consider 2-factorizations of the complete graph Kv whose automorphism group is ”rich” in some sen...
It is shown that a 1-factorization of Kn with a doubly transitive automorphism group on vertices is ...
We consider 2-factorizations of complete graphs that possess an automorphism group fixing k≥0 vertic...
Symmetric graph designs, or SGDs, were defined by Gronau et al. as a common generalization of symmet...
We introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-factorization...
AbstractUsing the classification of finite doubly transitive groups the finite two-graphs which admi...
We introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-factorizatio...
AbstractWe introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-facto...
In this paper I shall try to review some results which were obtained in the area of factorizations a...
AbstractIf D is a 2-(v, k, 1) design admitting a group G of automorphisms which acts doubly homogene...