Pattern avoidance in the matching pattern poset

Matteo Cervetti, Luca Ferrari

A matching of the set $[2n]=\{1,2,\dots ,2n\}$ is a partition of $[2n]$ into blocks with two elements, i.e. a graph on $[2n]$ such that every vertex has degree one. Given two mat…