✦ LIBER ✦

Labelled trees and factorizations of a cycle into transpositions

✍ Scribed by I.P. Goulden; S. Pepper

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 430 KB
Volume: 113
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90522-u

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Factoring, into Edge Transpositions of a

Factoring, into Edge Transpositions of a Tree, Permutations Fixing a Terminal Vertex

✍ John H. Smith 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 71 KB

If the symmetric group is generated by transpositions corresponding to the edges of a spanning tree we discuss identities they satisfy, including a set of defining relations. We further show that a minimal length factorization of a permutation fixing a terminal vertex does not involve the unique edg

Embedding of cycles and wheels into arbi

Embedding of cycles and wheels into arbitrary trees

✍ Indra Rajasingh; Albert William; Jasintha Quadras; Paul Manuel 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

A theorem on labelled trees and the limi

A theorem on labelled trees and the limits of its provability

✍ Helmut Pfeiffer 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 785 KB

Minimal Factorizations of a Cycle and Ce

Minimal Factorizations of a Cycle and Central Multiplicative Functions on the Infinite Symmetric Group

✍ Philippe Biane 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 508 KB

We show that the number of factorizations \_=/ 1 } } } / r of a cycle of length n into a product of cycles of lengths a 1 , ..., a r , with r j=1 (a j &1)=n&1, is equal to n r&1 . This generalizes a well known result of J. Denes, concerning factorizations into a product of transpositions. We investi

Decomposition of the complete graph plus

Decomposition of the complete graph plus a 1-factor into cycles of equal length

✍ Mateja Šajna 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB 👁 1 views

## Abstract We determine the necessary and sufficient conditions for the existence of a decomposition of the complete graph of even order with a 1‐factor added into cycles of equal length. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 170–207, 2003; Published online in Wiley InterScience (www

Embedding edge-colorings into 2-edge-con

Embedding edge-colorings into 2-edge-connected k-factorizations of kkn+1

✍ C. A. Rodger; E. B. Wantland 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 812 KB

## Abstract In this paper we use the Hilton method of amalgamations to give a different proof of a theorem of Nash‐Williams that finds necessary and sufficient conditions for the embedding of an edge‐colored __K__~__v__~ into an edge‐colored __K__~__v__~ in which the edges of each color induce a 2‐