Related papers: Patterns in Khovanov link and chromatic graph homo…
We define a deformation of our earlier link homologies for fundamental representations of sl_m. The deformed homology of a link is isomorphic to the deformed homology of the disjoint union of its components. Moreover, there exists a…
A topological index of a graph $G$ is a real number which is preserved under isomorphism. Extensive studies on certain polynomials related to these topological indices have also been done recently. In a similar way, chromatic versions of…
For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…
Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs $G$ and $H$ are called homomorphism indistinguishable over a graph class $\mathcal{F}$ if for each $F \in \mathcal{F}$,…
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…
We partially solve the conjecture by A.Shumakovitch about torsion in the Khovanov homology of prime, non-split links in S^3. We give a size restriction on the Khovanov homology of almost alternating links. We relate the Khovanov homology of…
We investigate Bar-Natan's characteristic two Khovanov link homology theory studying both the filtered and bi-graded theories. The filtered theory is computed explicitly and the bi-graded theory analysed by setting up a family of spectral…
A link homology is defined that is independent of link diagrams. This diagramless homology is closely related to Khovanov homology.
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,…
There is a $p$-differential on the triply-graded Khovanov--Rozansky homology of knots and links over a field of positive characteristic $p$ that gives rise to an invariant in the homotopy category finite-dimensional $p$-complexes. A…
The Khovanov homology of a link in $S^3$ and the Heegaard Floer homology of its branched double cover are related through a spectral sequence constructed by Ozsv\'ath and Szab\'o. This spectral sequence has topological applications but is…
We show that the Khovanov and Cooper-Krushkal models for colored sl(2) homology are equivalent in the case of the unknot, when formulated in the quantum annular Bar-Natan category. Again for the unknot, these two theories are shown to be…
We use the knot homology of Khovanov and Lee to construct link concordance invariants generalizing the Rasmussen $s$-invariant of knots. The relevant invariant for a link is a filtration on a vector space of dimension $2^{|L|}$. The basic…
In their recent preprint, Baldwin, Ozsv\'{a}th and Szab\'{o} defined a twisted version (with coefficients in a Novikov ring) of a spectral sequence, previously defined by Ozsv\'{a}th and Szab\'{o}, from Khovanov homology to Heegaard-Floer…
In recent years, A. Grigor'yan, Y. Lin, Y. Muranov and S.T. Yau [6, 7, 8, 9] constructed a path homology theory for digraphs. Later, S. Chowdhury and F. Memoli [3] studied the persistent path homology for directed networks. In this paper,…
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)$…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
We construct an equivariant colored sl(N)-homology for links, which generalizes both the colored sl(N)-homology defined by the author and the equivariant sl(N)-homology defined by Krasner. The construction is a straightforward…
Over 50 years ago, Lov\'{a}sz proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--328]. In this work we prove that two graphs are quantum…
We study the complexity of a class of promise graph homomorphism problems. For a fixed graph H, the H-colouring problem is to decide whether a given graph has a homomorphism to H. By a result of Hell and Ne\v{s}et\v{r}il, this problem is…