The uncrossing partial order on matchings is Eulerian
classification
🧮 math.CO
keywords
eulerianmatchingsorderpartialcirclecrossingsgivenpoints
read the original abstract
We prove that the partial order on the set of matchings of 2n points on a circle, given by resolving crossings, is an Eulerian poset.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.