Related papers: Homotopy theory for digraphs
Hypergraphs have seen widespread application in network and data science communities in recent years. We present a survey of recent work to construct auxiliary structures from hypergraphs -- specifically simplicial, relative, and chain…
For a fixed graph $H$ and for arbitrarily large host graphs $G$, the number of homomorphisms from $H$ to $G$ and the number of subgraphs isomorphic to $H$ contained in $G$ have been extensively studied in extremal graph theory and graph…
With a view towards providing tools for analyzing and understanding digitized images, various notions from algebraic topology have been introduced into the setting of digital topology. In the ordinary topological setting, invariants such as…
In the present paper we construct a one-to-one correspondence between the set of graph-knots and the set of homotopy classes of looped graphs. Moreover, the graph-knot and the homotopy class constructed from a given knot are related with…
In previous work, the first author defined homotopy theories for stratified spaces from a simplicial and a topological perspective. In both frameworks stratified weak-equivalences are detected by suitable generalizations of homotopy links.…
Consider a family $\mathcal F$ of $C_{2r+1}$-free graphs, where $r\geq 2$. Suppose that each graph in $\mathcal F$ has minimum degree linear in its number of vertices. Thomassen showed that such a family has bounded chromatic number, or,…
It was proven by Gonz\'alez-Meneses, Manch\'on and Silvero that the extreme Khovanov homology of a link diagram is isomorphic to the reduced (co)homology of the independence simplicial complex obtained from a bipartite circle graph…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
We define cofinite graphs and cofinite groupoids in a unified way that extends the notion of cofinite groups introduced by Hartley. The common underlying structure of all these objects is that they are directed graphs endowed with a certain…
The guessing number of a directed graph (digraph), equivalent to the entropy of that digraph, was introduced as a direct criterion on the solvability of a network coding instance. This paper makes two contributions on the guessing number.…
The notion of an upward plane graph in graph theory and that of a progressive plane graph (or plane string diagram) in category theory are essentially the same thing. In this paper, we combine the ideas in graph theory and category theory…
Normal maps between discrete groups $N\rightarrow G$ were characterized [FS] as those which induce a compatible topological group structure on the homotopy quotient $EN\times_N G$. Here we deal with topological group (or loop) maps…
We demonstrate that the proper homotopy equivalence relation for locally finite graphs is Borel complete. Furthermore, among the infinite graphs, there is a comeager equivalence class. As corollaries, we obtain the analogous results for the…
In this paper, we construct and study derived character maps of finite-dimensional representations of $\infty$-groups. As models for $\infty$-groups we take homotopy simplicial groups, i.e. homotopy simplicial algebras over the algebraic…
Two important invariants of directed graphs, namely magnitude homology and path homology, have recently been shown to be intimately connected: there is a 'magnitude-path spectral sequence' or 'MPSS' in which magnitude homology appears as…
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…
We introduce a graded homology theory for graded \'etale groupoids. For $\mathbb Z$-graded groupoids, we establish an exact sequence relating the graded zeroth-homology to non-graded one. Specialising to the arbitrary graph groupoids, we…
Working in the soft-element (classical) viewpoint, we introduce \emph{soft bitopological groups}: soft groups endowed with two soft topologies such that the induced topologies on the set of soft elements make the soft-element group into a…
We bring a linkage from representation theory of Lie groups to homotopy theory for maps between flag manifolds. As applications we derive from representation theory abundant families of homotopy classes of maps between flag manifolds whose…
It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma.…