Dyck paths and pattern-avoiding matchings

How many matchings on the vertex set V = { 1 , 2 , … , 2 n } avoid a given configuration of three edges? Chen, Deng and Du have shown that the number of matchings that avoid three nesting edges is equal to the number of matchings avoiding three pairwise crossing edges. In this paper, we consider other forbidden configurations of size three. We present a bijection between matchings avoiding three crossing edges and matchings avoiding an edge nested below two crossing edges. This bijection uses non-crossing pairs of Dyck paths of length 2 n as an intermediate step. from that, we give a bijection that maps matchings avoiding two nested edges crossed by a third edge onto the matchings avoiding all configurations from an infinite family M , which contains the configuration consisting of three crossing edges. We use this bijection to show that for matchings of size n > 3 , it is easier to avoid three crossing edges than to avoid two nested edges crossed by a third edge. sults on pattern-avoiding matchings can be regarded as an extension of previous results on pattern-avoiding permutations.