✦ LIBER ✦

Nesting of cycle systems of odd length

✍ Scribed by C.C. Lindner; C.A. Rodger; D.R. Stinson

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 780 KB
Volume: 77
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90360-9

No coin nor oath required. For personal study only.

✦ Synopsis

m edges {x1, x2}, {x2, x3}, . . . , {x,,,_~, x,}, {x,, xl} such that the vertices x1

📜 SIMILAR VOLUMES

Nesting directed cycle systems of even l

Nesting directed cycle systems of even length

✍ C.A. Rodger; D.R. Stinson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Small embeddings for partial cycle syste

Small embeddings for partial cycle systems of odd length

✍ C.C. Lindner; C.A. Rodger; D.R. Stinson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 497 KB

We prove that if m is odd then a partial m-cycle system on n vertices can be embedded in an m-cycle system on at most m((m -2)n(n -1) + 2n + 1) vertices and that a partial weak Steiner m-cycle system on n vertices can be embedded in an m-cycle system on m(2n + 1) vertices.

On the construction of odd cycle systems

✍ D. G. Hoffman; C. C. Lindner; C. A. Rodger 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 406 KB

Three obvious necessary conditions for the existence of a k-cycle system of order n are that if n > 1 then n 1 k, n is odd, and 2 k divides n(n -1). We show that if these necessary conditions are sufficient for all n satisfying k I n < 3k then they are sufficient for all n. In particular, there exis

Decomposing complete equipartite graphs

Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd

✍ Benjamin R. Smith 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract In this article, we introduce a new technique for obtaining cycle decompositions of complete equipartite graphs from cycle decompositions of related multigraphs. We use this technique to prove that if __n__, __m__ and λ are positive integers with __n__ ≥ 3, λ≥ 3 and __n__ and λ both odd

Almost resolvable decompositions of 2Kn

Almost resolvable decompositions of 2Kn into cycles of odd length

✍ Katherine Heinrich; C.C Lindner; C.A Rodger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 706 KB

Rotational k-cycle systems of order v k;

Rotational k-cycle systems of order v k; another proof of the existence of odd cycle systems

✍ Marco Buratti 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract We give an explicit solution to the existence problem for 1‐rotational __k__‐cycle systems of order __v__ < 3__k__ with __k__ odd and __v__ ≠ 2__k__ + 1. We also exhibit a 2‐rotational __k__‐cycle system of order 2__k__ + 1 for any odd __k__. Thus, for __k__ odd and any admissible __v__