The uncrossing partial order on matchings is Eulerian
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.