All Questions
Tagged with discrete-morse-theory enumerative-combinatorics
1
question
0
votes
2
answers
535
views
Morse matching with 0-cells and (n-1)-cells
Suppose one has a Morse matching (acyclic matching) of a poset $P$ of rank $n$ in which the only unmatched cells are 0-cells and $(n-1)$-cells, the same number $k$ of each one.
If $P$ is connected ...