Journal of Combinatorial Theory, 4, 1970, 361-375.
Dominique Foata and Aimé Fuchs
Réarrangements de fonctions et
dénombrement,
Abstract.
A theorem on rearrangements of mappings of a finite set on itself is stated, that generalises a well-known result on permutations. This allows to reprove the enumeration of classes of ultlmately idempotent and undecomposable mappings, as well as the count of trees with n vertices, and also the connected graphs with n edges and n vertices.
foata@unistra.fr
The following version is available: