Related papers: Morse and Lusternik-Schnirelmann for graphs
A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a…
We consider bounds on maximum nullity of a graph via transversal numbers of compatible collections of forts. Results include generalizations of theorems from symmetric to combinatorially symmetric matrices, special bases of matrix…
The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple…
We develop an analytic framework for Lefschetz fixed point theory and Morse theory for Hilbert complexes on stratified pseudomanifolds. We develop formulas for both global and local Lefschetz numbers and Morse, Poincar\'e polynomials as…
We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.
The lattice cohomology of a plumbed 3--manifold $M$ associated with a connected negative definite plumbing graph is an important tool in the study of topological properties of $M$, and in the comparison of the topological properties with…
Since the transformative workshop by the American Institute of Mathematics on the minimum rank of a graph, two longstanding open problems have captivated the community interested in the minimum rank of graphs: the graph complement…
In the cut-query model, the algorithm can access the input graph $G=(V,E)$ only via cut queries that report, given a set $S\subseteq V$, the total weight of edges crossing the cut between $S$ and $V\setminus S$. This model was introduced by…
The notion of entropy appears in many fields and this paper is a survey about entropies in several branches of Mathematics. We are mainly concerned with the topological and the algebraic entropy in the context of continuous endomorphisms of…
We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…
A symmetric Lorenz map is obtain by ``flipping'' one of the two branches of a symmetric unimodal map. We use this to derive a Sharkovsky-like theorem for symmetric Lorenz maps, and also to find cases where the unimodal map restricted to the…
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end…
In bounding the homology of a manifold, Forman's Discrete Morse theory recovers the full precision of classical Morse theory: Given a PL triangulation of a manifold that admits a Morse function with c_i critical points of index i, we show…
In the context of the chromatic-number problem, a critical graph is an instance where the deletion of any element would decrease the graph's chromatic number. Such instances have shown to be interesting objects of study for deepen the…
We prove a version of the fundamental theorems of Morse Theory in the setting of finite spaces or partially ordered sets. By using these results we extend Forman's discrete Morse theory to more general cell complexes and derive the…
We introduce a coarse analog of the classical Lusternik-Schnirelmann category which we denote by $\text{c-cat}$, defined for metric spaces in the coarse homotopy category. This provides a new tool for studying large-scale topological…
Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $\chi$-boundedness but for minimum…
Two unanswered questions in the heart of the theory of Leavitt path algebras are whether Grothendieck group $K_0$ is a complete invariant for the class of unital purely infinite simple algebras and, a weaker question, whether $L_2$ (the…
We use noncommutative localization to construct a chain complex which counts the critical points of a circle-valued Morse function on a manifold, generalizing the Novikov complex. As a consequence we obtain new topological lower bounds on…
Chessboard complexes and their generalizations, as objects, and Discrete Morse theory, as a tool, are presented as a unifying theme linking different areas of geometry, topology, algebra and combinatorics. Edmonds and Fulkerson bottleneck…