Related papers: A spanning tree model for chromatic homology
We iterate Manolescu's unoriented skein exact triangle in knot Floer homology with coefficients in the field of rational functions over $\mathbb{Z}/2\mathbb{Z}$. The result is a spectral sequence which converges to a stabilized version of…
We study the multicolour discrepancy of spanning trees and Hamilton cycles in graphs. As our main result, we show that under very mild conditions, the $r$-colour spanning-tree discrepancy of a graph $G$ is equal, up to a constant, to the…
Let $R$ and $B$ be two disjoint sets of points in the plane where the points of $R$ are colored red and the points of $B$ are colored blue, and let $n=|R\cup B|$. A bichromatic spanning tree is a spanning tree in the complete bipartite…
A rainbow spanning tree in an edge-colored graph is a spanning tree in which each edge is a different color. Carraher, Hartke, and Horn showed that for $n$ and $C$ large enough, if $G$ is an edge-colored copy of $K_n$ in which each color…
We obtain sufficient conditions for the emergence of spanning and almost-spanning bounded-degree {\sl rainbow} trees in various host graphs, having their edges coloured independently and uniformly at random, using a predetermined palette.…
In this paper we construct spanning trees in hyperbolic graphs that represent their hyperbolic compactification in a good way: so that the tree has a bounded number of distinct rays to each boundary point. The bound depends only on the…
Let $G$ be a simple finite connected graph of order $n$. The detour distance between two distinct vertices $u$ and $v$ denoted by $D(u,v)$ is the length of a longest $uv$-path in $G$. A hamiltonian coloring $h$ of a graph $G$ of order $n$…
Khovanov homology, an invariant of links in $\mathbb{R}^3$, is a graded homology theory that categorifies the Jones polynomial in the sense that the graded Euler characteristic of the homology is the Jones polynomial. Asaeda, Przytycki and…
Let $\Delta$ be a trivial knot in the three-sphere. For every finite cyclic group $G$ of odd order, we construct a $G$-equivariant Khovanov homology with coefficients in the filed $\F_{2}$. This homology is an invariant of links up to…
Khovanov homology for knots has generated a flurry of activity in the topology community. This paper studies the Khovanov type cohomology for graphs with a special attention to torsions. When the underlying algebra is $\mathbb{Z}[x]/(x^2)$,…
The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a…
Chromatic-choosablility is a notion of fundamental importance in list coloring. A graph is chromatic-choosable when its chromatic number is equal to its list chromatic number. In 1990, Kostochka and Sidorenko introduced the list color…
In 2001, Brualdi and Hollingsworth proved that an edge-colored balanced complete bipartite graph Kn,n with a color set C = {1,2,3,..., 2n-1} has a heterochromatic spanning tree if the number of edges colored with colors in R is more than…
We define a variation of Khovanov homology with an explicit description in terms of the spanning trees of a link projection. We prove that this new theory is a link invariant and describe some of its properties. Finally, we provide some the…
We use categorical annular evaluation to give a uniform construction of both $\mathfrak{sl}_n$ and HOMFLYPT Khovanov-Rozansky link homology, as well as annular versions of these theories. Variations on our construction yield…
The aim of this paper is two-fold. First, we give a fully geometric description of the HOMFLYPT homology of Khovanov-Rozansky. Our method is to construct this invariant in terms of the cohomology of various sheaves on certain algebraic…
We show that Khovanov homology and Hochschild homology theories share common structure. In fact they overlap: Khovanov homology of a $(2,n)$-torus link can be interpreted as a Hochschild homology of the algebra underlining the Khovanov…
We lift the characteristic-2 totally twisted Khovanov homology of Roberts and Jaeger to a theory with integer coefficients. The result is a complex computing reduced odd Khovanov homology for knots. This complex is equivalent to a…
The Stanley chromatic symmetric function $X_G$ of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology…
Mikhail Khovanov in math.QA/9908171 defined, for a diagram of an oriented classical link, a collection of groups numerated by pairs of integers. These groups were constructed as homology groups of certain chain complexes. The Euler…