✦ LIBER ✦

On the existence of rainbows in 1-factorizations of K2n

✍ Scribed by David E. Woolbright; Hung-Lin FU

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 745 KB
Volume: 6
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(1998)6:1<1::aid-jcd1>3.0.co;2-j

No coin nor oath required. For personal study only.

✦ Synopsis

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.''

📜 SIMILAR VOLUMES

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

On Integers of the Forms k−2n and k2n+1

✍ Yong-Gao Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 85 KB

In this paper we prove that the set of positive odd integers k such that k&2 n has at least three distinct prime factors for all positive integers n contains an infinite arithmetic progression. The same result corresponding to k2 n +1 is also true.

The existence of a 2-factor in K1, n-fre

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity

✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.

Note on the existence of directed (k + 1

Note on the existence of directed (k + 1)-cycles in diconnected complete k-partite digraphs

✍ R. Balakrishnan; P. Paulraja 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

A graph is constructed to provide a negative answer to the following question of Bondy: Does every diconnected orientation of a complete k-partite (k 2 5) graph with each part of size at least 2 yield a directed (k + 1)-cycle?

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

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