Related papers: Complexes of graph homomorphisms
Given finite simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex having the graph homomorphisms $G\to H$ as the vertices. We determine the homotopy type of each connected component of $\mathrm{Hom}(G,H)$…
For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…
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…
Given a finite simplicial complex $X$ and a connected graph $T$ of diameter $1$, in \cite{anton} Dochtermann had conjectured that $\text{Hom}(T,G_{1,X})$ is homotopy equivalent to $X$. Here, $G_{1, X}$ is the reflexive graph obtained by…
The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the…
We introduce new methods for understanding the topology of $\Hom$ complexes (spaces of homomorphisms between two graphs), mostly in the context of group actions on graphs and posets. We view $\Hom(T,-)$ and $\Hom(-,G)$ as functors from…
For a pair $(H_1,H_2)$ of graphs, Lov\'{a}sz introduced a polytopal complex called the Hom complex $\text{Hom}(H_1,H_2)$, in order to estimate topological lower bounds for chromatic numbers of graphs. The definition is generalized to…
The neighborhood complex of a graph was introduced by Lov\'asz to provide topological lower bounds on chromatic number. More general homomorphism complexes of graphs were further studied by Babson and Kozlov. Such `Hom complexes' are also…
In this paper we study the homotopy type of $\Hom(C_m,C_n)$, where $C_k$ is the cyclic graph with $k$ vertices. We enumerate connected components of $\Hom(C_m,C_n)$ and show that each such component is either homeomorphic to a point or…
We prove that the topological connectivity of a graph homomorphism complex Hom($G,K_m$) is at least $m-D(G)-2$, where $\displaystyle D(G)=\max_{H\subseteq G}\delta(H)$. This is a strong generalization of a theorem of Cuki\'{c} and Kozlov,…
We show P\'eter Csorba's conjecture that the graph homomorphism complex Hom(C_5,K_{n+2}) is homeomorphic to a Stiefel manifold, the space of unit tangent vectors to the n-dimensional sphere. For this a general tool is developed that allows…
We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological…
The matching complex $\mathsf{M}(G)$ of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. These complexes appear in various places and found applications in many areas of mathematics including computational geometry,…
Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…
For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…
The stable Kneser graph $SG_{n,k}$, $n\ge1$, $k\ge0$, introduced by Schrijver \cite{schrijver}, is a vertex critical graph with chromatic number $k+2$, its vertices are certain subsets of a set of cardinality $m=2n+k$. Bj\"orner and de…
The notion of $\times$-homotopy from \cite{DocHom} is investigated in the context of the category of pointed graphs. The main result is a long exact sequence that relates the higher homotopy groups of the space $\Hom_*(G,H)$ with the…
We show that the independence complexes of generalised Mycielskian of complete graphs are homotopy equivalent to a wedge sum of spheres, and determine the number of copies and the dimensions of these spheres. We also prove that the…
Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by V. Vassiliev. In this paper we study the complexes of not $i$-connected $k$-hypergraphs on $n$ vertices. We show that…
Schrijver identified a family of vertex critical subgraphs of the Kneser graphs called the stable Kneser graphs $SG_{n,k}$. Bj\"{o}rner and de Longueville proved that the neighborhood complex of the stable Kneser graph $SG_{n,k}$ is…