Related papers: A spanning tree model for chromatic homology
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
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…
J. Przytycki has established a connection between the Hochschild homology of an algebra $A$ and the chromatic graph homology of a polygon graph with coefficients in $A$. In general the chromatic graph homology is not defined in the case…
Khovanov homology ist a new link invariant, discovered by M. Khovanov, and used by J. Rasmussen to give a combinatorial proof of the Milnor conjecture. In this thesis, we give examples of mutant links with different Khovanov homology. We…
In 2006, Suzuki, and Akbari & Alipour independently presented a necessary and sufficient condition for edge-colored graphs to have a heterochromatic spanning tree, where a heterochromatic spanning tree is a spanning tree whose edges have…
Crew and Spirklt generalize Stanley's chromatic symmetric function to vertex-weighted graphs. One of the primary motivations for extending the chromatic symmetric function to vertex-weighted graphs is the existence of a deletion-contraction…
In this note, we prove the existence of a tri-graded Khovanov-type bicomplex (Theorem 1.2). The graded Euler characteristic of the total complex associated with this bicomplex is the colored Jones polynomial of a link. The first grading of…
Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…
The family of Thom spectra $y(n)$ interpolates between the sphere spectrum and the mod two Eilenberg--MacLane spectrum. Computations of Mahowald, Ravenel, Shick, and the authors show that the associative ring spectrum $y(n)$ has type $n$.…
In this paper, we investigate the strength of chromatic symmetric homology as a graph invariant. Chromatic symmetric homology is a lift of the chromatic symmetric function for graphs to a homological setting, and its Frobenius…
In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…
For any connected multigraph $G=(V,E)$ and any $M\subseteq E$, if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are complete graphs, a formula for $\tau_G(M)$ is obtained,…
Recent results show that the structural similarity of graphs can be characterized by counting homomorphisms to them: the Tree Theorem states that the well-known color-refinement algorithm does not distinguish two graphs G and H if and only…
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…
The SO(3) Kauffman polynomial and the chromatic polynomial of planar graphs are categorified by a unique extension of the Khovanov homology framework. Many structural observations and computations of homologies of knots and spin networks…
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…
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$.…
Stanley [9] introduced the chromatic symmetric function ${\bf X}_G$ associated to a simple graph $G$ as a generalization of the chromatic polynomial of $G$. In this paper we present a novel technique to write ${\bf X}_G$ as a linear…
It is conjectured that the Khovanov homology of a knot is invariant under mutation. In this paper, we review the spanning tree complex for Khovanov homology, and reformulate this conjecture using a matroid obtained from the Tait graph…