A spanning tree model for chromatic homology
math.CO, math.QA
Submitted: 2025-04-01
Updated: 2026-10-27
Comments: Improved exposition and minor corrections
License: http://creativecommons.org/licenses/by/4.0/
The gist: After the discovery of Khovanov homology, which categorifies the Jones polynomial, an analogous categorification of the chromatic polynomial, known as chromatic homology, was introduced.
Terminology
Abstract
After the discovery of Khovanov homology, which categorifies the Jones polynomial, an analogous categorification of the chromatic polynomial, known as chromatic homology, was introduced. Its graded Euler characteristic recovers the chromatic polynomial. In this paper, we present a spanning tree model for the chromatic complex, i.e., we describe a chain complex generated by certain spanning trees of the graph that is chain homotopy equivalent to the chromatic complex. We employ the spanning tree model over A m:= Z[x] over<x m> algebra to answer two open questions. First, we establish the conjecture posed by Sazdanovic and Scofield regarding the homological span of chromatic homology over A m algebra, demonstrating that for any graph G with v vertices and b blocks, the homological span is v - b. Additionally, we prove a conjecture of Helme-Guizon, Przytycki, and Rong concerning the existence of torsion of order dividing m in chromatic homology over A m algebra.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality