A categorification for the chromatic polynomial

From MaRDI portal
Publication:2571387



Abstract: For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known deletion-contraction rule. This work is motivated by Khovanov's work on categorification of the Jones polynomial of knots.


Given a graph, the authors construct a graded chain complex, and from its cohomology develop a formula analogous to the classic deletion-contraction equation for the chromatic polynomial. The work derives from that of \textit{M. Khovanov} [Duke Math J. 101, 359--426 (2000; Zbl 0960.57005)] who constructed a cohomology theory for knots, using the state sum.




Cited in
(41)








This page was built for publication: A categorification for the chromatic polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571387)