AbstractWe construct an infinite family of one-factorizations of Kv admitting an automorphism group acting primitively on the set of vertices but no such group acting doubly transitively. We also give examples of one-factorizations which are live, in the sense that every one-factor induces an automorphism, but do not coincide with the affine line parallelism of AG(n,2). To this purpose we develop the notion of a “mixed translation” in AG(n,2)
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect matchings. T...
A perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors such tha...
We construct an infinite family of one-factorizations of K_v admitting an automorphism group acting ...
AbstractWe construct an infinite family of one-factorizations of Kv admitting an automorphism group ...
It is shown that a 1-factorization of Kn with a doubly transitive automorphism group on vertices is ...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
Let F be a one\u2013factorization of K_2m and let H be an automorphism group of F acting sharply tra...
AbstractWe introduce a theory of elation and translation semipartial geometries (SPG). Starting from...
A survey on the state of art on the problem of constructing one-factorizations of complete graph whi...
For each finitely generated abelian group G, we construct a 1-factorization of the countable complet...
We consider k-factorizations of the complete graph that are 1-rotational under an assigned group G, ...
We consider 2-factorizations of the complete graph Kv whose automorphism group is \u201drich\u201d i...
We consider k-factorizations of the complete graph that are 1-rotational under an assigned group G, ...
Abstract: A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect ma...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect matchings. T...
A perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors such tha...
We construct an infinite family of one-factorizations of K_v admitting an automorphism group acting ...
AbstractWe construct an infinite family of one-factorizations of Kv admitting an automorphism group ...
It is shown that a 1-factorization of Kn with a doubly transitive automorphism group on vertices is ...
We consider one-factorizations of K_2n possessing an automorphism group acting regularly (sharply ...
Let F be a one\u2013factorization of K_2m and let H be an automorphism group of F acting sharply tra...
AbstractWe introduce a theory of elation and translation semipartial geometries (SPG). Starting from...
A survey on the state of art on the problem of constructing one-factorizations of complete graph whi...
For each finitely generated abelian group G, we construct a 1-factorization of the countable complet...
We consider k-factorizations of the complete graph that are 1-rotational under an assigned group G, ...
We consider 2-factorizations of the complete graph Kv whose automorphism group is \u201drich\u201d i...
We consider k-factorizations of the complete graph that are 1-rotational under an assigned group G, ...
Abstract: A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect ma...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect matchings. T...
A perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors such tha...