✦ LIBER ✦

On the number of 1-factorizations of the complete graph

✍ Scribed by Charles C Lindner; Eric Mendelsohn; Alexander Rosa

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 929 KB
Volume: 20
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90017-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

On one-factorizations of the complete gr

On one-factorizations of the complete graph

✍ L Pyber 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 66 KB

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 K1,k-factorizations of a complete bip

On K1,k-factorizations of a complete bipartite graph

✍ Hong Wang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 311 KB

We present a necessary condition for a complete bipartite graph K,., to be K,.,-factorizable and a sufficient condition for K,,, to have a K,,,-factorization whenever k is a prime number. These two conditions provide Ushio's necessary and sufficient condition for K,,, to have a K,,,-factorization.

Sharply transitive 1-factorizations of t

Sharply transitive 1-factorizations of the complete graph with an invariant 1-factor

✍ Gábor Korchmáros 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 682 KB

## Abstract We give some simple characterizations of those __n__ for which __K~n~__ has a sharply transitive 1‐factorization with an assigned automorphism group that acts sharply transitively on the vertex set and also fixes a 1‐factor. © 1994 John Wiley & Sons, Inc.