𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The existence of Ck-factorizations of K2n − F

✍ Scribed by D.G. Hoffman; P.J. Schellenberg

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
414 KB
Volume
97
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

A necessary condition for the existence of a C,-factorization of KZn -F is that k divides 2n. It is known that neither K, -F nor K,, -F admit a C,-factorization.

In this paper we show that except for these two cases, the necessary condition is also sufficient.

📜 SIMILAR VOLUMES

On the existence of rainbows in 1-factor
On the existence of rainbows in 1-factorizations of K2n
✍ David E. Woolbright; Hung-Lin FU 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 745 KB

A 1-factor of a graph G = (V, E) is a collection of disjoint edges which contain all the vertices of V . Given a 2n -1 edge coloring of K2n, n ≥ 3, we prove there exists a 1-factor of K2n whose edges have distinct colors. Such a 1-factor is called a ''Rainbow.''

On the existence of a rainbow 1-factor i
On the existence of a rainbow 1-factor in 1-factorizations of K
✍ S.I. El-Zanati; M.J. Plantholt; P.A. Sissokho; L.E. Spence 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB 👁 1 views

## Abstract Let ${\cal F}$ be a 1‐factorization of the complete uniform hypergraph ${\cal G}={K\_{rn}^{(r)}}$ with $r \geq 2$ and $n\geq 3$. We show that there exists a 1‐factor of ${\cal G}$ whose edges belong to __n__ different 1‐factors in ${\cal F}$. Such a 1‐factor is called a “rainbow” 1‐fact

Toughness and the existence of k-factors
Toughness and the existence of k-factors
✍ Hikoe Enomoto; Bill Jackson; P. Katerinis; Akira Saito 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 317 KB 👁 1 views
Toughness and the existence of k-factors
Toughness and the existence of k-factors. III
✍ Hikoe Enomoto 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 312 KB

In a paper with the same title (Enomoto et al., 1985) we proved Chv&al's conjecture that ktough graphs have k-factors if they satisfy trivial necessary conditions. In this paper, we introduce a variation of toughness, and prove a stronger result for the existence of l-or 2-factors. This solves a con

Some conditions for the existence of f-f
Some conditions for the existence of f-factors
✍ P. Katerinis 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB 👁 1 views

Let m, 1, n be three odd integers such that m < I < n. It is proved that if a graph G has an mfactor and an rrfactor, then it also has an /factor. In addition, we obtain sufficient conditions for the existence of an f-factor, in terms of vertexdeleted subgraphs. All graphs considered here are multi