AbstractAt the problem session of the 14th British Combinatorial Conference, Cameron asked for a bijection between the set of permutations of 1, 2, …, n with all cycles of even length and the set of permutations of 1, 2, …,n with all cycles odd (where n is even). Here we give bijections between more general sets of permutations
AbstractWe prove by elementary combinatorial methods that the number of factorizations of an n-cycle...
A graph is called odd if there is an orientation of its edges and an automorphism that reverses the ...
AbstractOver all plane trees with n edges, the total number of vertices with odd degree is twice the...
AbstractWe prove bijectively that the total number of cycles of all even permutations of [n]={1,2,…,...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
International audienceWe give simple combinatorial proofs of some formulas for the number of factori...
AbstractThe central result of this paper is a generalization of the theorem that, for n ≥ 5, every e...
AbstractA recursion is developed for the number ƒ;(P) of ways a permutation P on n symbols can be wr...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
In a prize winning expository article, V. Pozdnyakov and J.M. Steele gave a beautiful demonstration ...
AbstractDenote by r(n) the length of a shortest integer sequence on a circle containing all permutat...
AbstractWe give a direct count of the number of permutations of n objects for which (a) all the cycl...
AbstractGiven integers k,l⩾2, where either l is odd or k is even, we denote by n=n(k,l) the largest ...
AbstractIt is proved that the number of permuations on 1, 2, ..., n with exactly one increasing subs...
AbstractA combinatorial proof is given of a result of Gessel and Greene relating the sizes of two cl...
AbstractWe prove by elementary combinatorial methods that the number of factorizations of an n-cycle...
A graph is called odd if there is an orientation of its edges and an automorphism that reverses the ...
AbstractOver all plane trees with n edges, the total number of vertices with odd degree is twice the...
AbstractWe prove bijectively that the total number of cycles of all even permutations of [n]={1,2,…,...
AbstractWe give simple combinatorial proofs of some formulas for the number of factorizations of per...
International audienceWe give simple combinatorial proofs of some formulas for the number of factori...
AbstractThe central result of this paper is a generalization of the theorem that, for n ≥ 5, every e...
AbstractA recursion is developed for the number ƒ;(P) of ways a permutation P on n symbols can be wr...
AbstractWe give a combinatorial proof of the formula giving the number of representations of an even...
In a prize winning expository article, V. Pozdnyakov and J.M. Steele gave a beautiful demonstration ...
AbstractDenote by r(n) the length of a shortest integer sequence on a circle containing all permutat...
AbstractWe give a direct count of the number of permutations of n objects for which (a) all the cycl...
AbstractGiven integers k,l⩾2, where either l is odd or k is even, we denote by n=n(k,l) the largest ...
AbstractIt is proved that the number of permuations on 1, 2, ..., n with exactly one increasing subs...
AbstractA combinatorial proof is given of a result of Gessel and Greene relating the sizes of two cl...
AbstractWe prove by elementary combinatorial methods that the number of factorizations of an n-cycle...
A graph is called odd if there is an orientation of its edges and an automorphism that reverses the ...
AbstractOver all plane trees with n edges, the total number of vertices with odd degree is twice the...
DOI
Add to ORKG