✦ LIBER ✦

On one-factorizations of the complete graph

✍ Scribed by L Pyber

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 66 KB
Volume: 67
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90030-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the size of graphs with complete-fact

On the size of graphs with complete-factors

✍ Jin Akiyama; Peter Frankl 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 1 views

Some new results on 1-rotational 2-facto

Some new results on 1-rotational 2-factorizations of the complete graph

✍ Tommaso Traetta 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract It is known that a necessary condition for the existence of a 1‐rotational 2‐factorization of the complete graph __K__~2__n__+1~ under the action of a group __G__ of order 2__n__ is that the involutions of __G__ are pairwise conjugate. Is this condition also sufficient? The complete ans

On the number of edge-disjoint one facto

On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs

✍ D.G. Hoffman; C.A. Rodger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 503 KB

In this paper we use Tutte's f-factor theorem and the method of amalgamations to find necessary and sufficient conditions for the existence of a k-factor in the complete multipartite graph K(p(1 ) ..... p(n)), conditions that are reminiscent of the Erd6s-Gallai conditions for the existence of simple

On 2-factorizations of the complete grap

On 2-factorizations of the complete graph: From the k-pyramidal to the universal property

✍ Simona Bonvicini; Giuseppe Mazzuoccolo; Gloria Rinaldi 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 1 views

## Abstract We consider 2‐factorizations of complete graphs that possess an automorphism group fixing __k__⩾0 vertices and acting sharply transitively on the others. We study the structures of such factorizations and consider the cases in which the group is either abelian or dihedral in some more d

Nilpotent 1-factorizations of the comple

Nilpotent 1-factorizations of the complete graph

✍ Gloria Rinaldi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

Abelian 1-Factorizations of the Complete

Abelian 1-Factorizations of the Complete Graph

✍ Marco Buratti 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Extending a result by Hartman and Rosa (1985, Europ. J. Combinatorics 6, 45-48), we prove that for any Abelian group G of even order, except for G Z 2 n with n > 2, there exists a onefactorization of the complete graph admitting G as a sharply-vertex-transitive automorphism group.