180math.AT
A matching W on the Hasse diagram of a finite simplicial complex K is a discrete Morse matching when reversing its edges leaves no directed cycle; the unmatched simplices are critical, and W is optimal when their number is minimal. How many optimal matching…
Contribute a review
Evidence summary
25 Lean theorems · 12 stated results · 2 source-labelled candidates. Lean build reported passed by the source. Inspect claims