Related papers: Connected-homomorphism-homogeneous graphs
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…
We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas…
We classify compact 2-connected homogeneous spaces with the same rational cohomology as a product of spheres. This classification relies on spectral sequences, homotopy theory, and representation theory. We then apply this classification to…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We geometrically describe the relation induced on a set of graphs by isomorphism of their associated graph C*-algebras as the smallest equivalence relation generated by five types of moves. The graphs studied have finitely many vertices and…
The Hom complex $\mathrm{Hom}(G, H)$ of graphs is a simplicial complex associated to a pair of graphs $G$ and $H$, and its homotopy type is of interest in the graph coloring problem and the homomorphism reconfiguration problem. In this…
A neighborhood homotopy is an equivalence relation on spatial graphs which is generated by crossing changes on the same component and neighborhood equivalence. We give a complete classification of all 2-component spatial graphs up to…
This is a survey of some of the consequences of the recently introduced congruences on the theory of connectednesses (radical classes) and disconnectednesses (semisimple classes) of graphs and topological spaces. In particular, it is shown…
The notion of ends in an infinite graph $G$ might be modified if we consider them as equivalence classes of infinitely edge-connected rays, rather than equivalence classes of infinitely (vertex-)connected ones. This alternative definition…
We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs,…
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
Graph homomorphism has been an important research topic since its introduction [17]. Stated in the language of binary relational structures in that paper [17], Lov\'asz proved a fundamental theorem that, for a graph $H$ given by its $0$-$1$…
We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…
Attractor-repeller decompositions of isolated invariant sets give rise to so-called connecting homomorphisms. These homomorphisms reveal information on the existence and structure of connecting trajectories of the underlying dynamical…
A finite group R is a CI-group if, whenever S and T are subsets of R with the Cayley graphs Cay(R,S) and Cay(R,T) isomorphic, there exists an automorphism x of R with S^x=T. The classification of CI-groups is an open problem in the theory…
This work is the extension of the results by the author in [7] and [6] for low-genus surfaces. Let $S$ be an orientable, connected surface of finite topological type, with genus $g \leq 2$, empty boundary, and complexity at least $2$; as a…
Let $\phi: G \rightarrow H$ be a group homomorphism such that $H$ is a totally disconnected locally compact (t.d.l.c.) group and the image of $\phi$ is dense. We show that all such homomorphisms arise as completions of $G$ with respect to…
We propose a homology theory for locally compact spaces with ends in which the ends play a special role. The approach is motivated by results for graphs with ends, where it has been highly successful. But it was unclear how the original…
For a set-endofunctor $F$, we extend the notion of universal $F$-coalgebras to $F$-graphs. These generalized coalgebras are models for various types of graphs, such as (un)directed (hyper)graphs, relational structures or fuzzy graphs. The…