✦ LIBER ✦

Cycle factorizations of powers of odd cycles

✍ Scribed by S. El-Zanati; C. Vanden Eynden

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 423 KB
Volume: 7
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(1999)7:3<173::aid-jcd2>3.0.co;2-d

No coin nor oath required. For personal study only.

✦ Synopsis

Let m ≥ 3 be an odd integer and let k, n, and s ≥ 3 be positive integers. We present sufficient conditions for the existence of Cs-factorizations of (C m k ) n . We show these conditions to be necessary when m is prime.

📜 SIMILAR VOLUMES

Homomorphisms of graphs into odd cycles

✍ A. M. H. Gerards 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB

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

Vertex colorings of graphs without short

Vertex colorings of graphs without short odd cycles

✍ Andrzej Dudek; Reshma Ramadurai 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

Motivated by the work of Nešetřil and R ödl on "Partitions of vertices" we are interested in obtaining some quantitative extensions of their result. In particular, given a natural number r and a graph G of order m with odd girth g, we show the existence of a graph H with odd girth at least g and ord

The multi-color Ramsey number of an odd

The multi-color Ramsey number of an odd cycle

✍ Yusheng Li 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB

## Abstract Let __r__~__k__~(__G__) be the __k__‐color Ramsey number of a graph __G__. It is shown that $r\_{k}(C\_{5})\le \sqrt{18^{k}\,k!}$ for __k__⩾2 and that __r__~__k__~(__C__~2__m__+ 1~)⩽(__c__^__k__^__k__!)^1/__m__^ if the Ramsey graphs of __r__~__k__~(__C__~2__m__+ 1~) are not far away fr

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__

Tree-like Properties of Cycle Factorizat

Tree-like Properties of Cycle Factorizations

✍ Ian Goulden; Alexander Yong 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 125 KB

We provide a bijection between the set of factorizations, that is, ordered (n -1)tuples of transpositions in S n whose product is (12...n), and labelled trees on n vertices. We prove a refinement of a theorem of J. Dénes (1959, Publ. Math. Inst. Hungar. Acad. Sci. 4, 63-71) that establishes new tree