Title of article
Hypermaps and indecomposable permutations
Author/Authors
Cori، نويسنده , , Robert، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
2
From page
540
To page
541
Abstract
It is shown that the number of hypermaps of size n , that is the number of ordered pairs of permutations generating a transitive subgroup of S n , is equal to ( n − 1 ) ! times the number of indecomposable permutations of S n + 1 . The proof is elementary.
Journal title
European Journal of Combinatorics
Serial Year
2009
Journal title
European Journal of Combinatorics
Record number
1547123
Link To Document