A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations (Q1119592)

From MaRDI portal
Revision as of 10:32, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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
    0 references
    0 references
    0 references

    Identifiers