Abstract
The goal of this work is to study the structure of the pure Morse complex of a graph, that is, the simplicial complex given by the set of all possible classes of discrete Morse functions (in Forman's sense) defined on it. First, we characterize the pure Morse complex of a tree and prove that it is collapsible. In order to study the general case, we consider all the spanning trees included in a given graph G and we express the pure Morse complex of G as the union of all pure Morse complexes corresponding to such trees.
Its a new way of encoding like Morse
No comments:
Post a Comment