✦ LIBER ✦

On the existence of a matching orthogonal to a 2-factorization

✍ Scribed by M. Kouider; D. Sotteau

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 310 KB
Volume: 73
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90274-4

No coin nor oath required. For personal study only.

✦ Synopsis

This note gives a partial answer to a problem posed by Brian Alspach in a recent issue of Discrete Mathematics. We show that if F,, F2, . . . , Fd is a Zfactorixation of a w-regular graph G of order n 2 3.23 d then G contains a d-matching with exactly one edge from each of 44, . . ., 4.

📜 SIMILAR VOLUMES

Comments on the paper “a short proof for

Comments on the paper “a short proof for the existence of the WZ-factorization”

✍ M. Hatzopoulos; D.J. Evans 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 63 KB

Forbidden subgraphs and the existence of

Forbidden subgraphs and the existence of a 2-factor

✍ R. E. L. Aldred; Jun Fujisawa; Akira Saito 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 1 views

## Abstract In this paper, we consider forbidden subgraphs which force the existence of a 2‐factor. Let \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}${\cal G}$\end{document} be the class of connected graphs of minimum degree at least two and maximum degree at least three, an

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

The 2-matching lattice of a graph

✍ Dieter Jungnickel; Matthias Leclerc 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 135 KB

A theorem on the factorization of matrix

A theorem on the factorization of matrix polynomials

✍ J. Maroulas 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 363 KB

A degree condition for the existence of

A degree condition for the existence of k-factors

✍ Tsuyoshi Nishimura 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB 👁 1 views

## Abstract Let __k__ be an integer such that ≦, and let __G__ be a connected graph of order __n__ with ≦, __kn__ even, and minimum degree at least __k__. We prove that if __G__ satisfies max(deg(u), deg(v)) ≦ n/2 for each pair of nonadjacent vertices __u, v__ in __G__, then __G__ has a __k__‐facto