A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations (Q1119592): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0195-6698(89)80028-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1974527570 / rank | |||
Normal rank | |||
Latest revision as of 10:32, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations |
scientific article |
Statements
A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations (English)
0 references
1989
0 references
\textit{J. Dénes} [Publ. Math. Inst. Hung. Acad. Sci. 4, 63-70 (1959; Zbl 0092.011)] proved that the set \(T_ n\) of labelled trees on n vertices and the set of representations of a given cyclic permutation (from the symmetric group of order n) as a product of n-1 transpositions have the same cardinality, and posed the question of finding a direct bijection between these two sets. This note provides such a bijection.
0 references
labelled trees
0 references
cyclic permutation
0 references
bijection
0 references
