Discrete Morse inequalities on infinite graphs (Q1028814): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 22:16, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Discrete Morse inequalities on infinite graphs |
scientific article |
Statements
Discrete Morse inequalities on infinite graphs (English)
0 references
8 July 2009
0 references
Summary: The goal of this paper is to extend to infinite graphs the known Morse inequalities for discrete Morse functions proved by \textit{R. Forman} [``Morse theory for cell complexes'', Adv. Math. 134, No.\,, 90--145 (1998; Zbl 0896.57023)] in the finite case. In order to get this result we shall use a special kind of infinite subgraphs on which a discrete Morse function is monotonous, namely, decreasing rays. In addition, we shall use this result to characterize infinite graphs by the number of critical elements of discrete Morse functions defined on them.
0 references
infinite graphs
0 references
Morse inequalities
0 references
Morse functions
0 references
infinite subgraphs
0 references