Shi-Mei Ma, Yeong-Nan Yeh
Published 2015-03-23, updated 2015-04-12Version 2
In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular, we discover that the Eulerian polynomials have a simple combinatorial interpretation in terms of some statistics on MY-sequences.
Klazar trees and perfect matchings
An upper bound for the number of perfect matchings in graphs
Eulerian polynomials, perfect matchings and Stirling permutations of the second kind
![QR code for arXiv:1503.06601 [math.CO]](http://oss.arxitics.com/images/favicon.svg)