Asymptotic analysis of $k$-noncrossing matchings

Emma Y. Jin, Christian M. Reidys, Rita R. Wang

In this paper we study $k$-noncrossing matchings. A $k$-noncrossing matching is a labeled graph with vertex set $\{1,...,2n\}$ arranged in increasing order in a horizontal line and…