Discrete Morse Inequalities on Infinite Graphs
Copyright policy )Discrete Morse Inequalities on Infinite Graphs
The goal of this paper is to extend to infinite graphs the known Morse inequalities for discrete Morse functions proved by R. Forman 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.
- University of Seville Spain
infinite graphs, Infinite graphs, Morse functions, Triangulating manifolds, Relations of low-dimensional topology with graph theory, infinite subgraphs, Morse inequalities, Planar graphs; geometric and topological aspects of graph theory
infinite graphs, Infinite graphs, Morse functions, Triangulating manifolds, Relations of low-dimensional topology with graph theory, infinite subgraphs, Morse inequalities, Planar graphs; geometric and topological aspects of graph theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!