A categorification for the chromatic polynomial (Q2571387)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A categorification for the chromatic polynomial |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A categorification for the chromatic polynomial |
scientific article |
Statements
A categorification for the chromatic polynomial (English)
0 references
1 November 2005
0 references
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.
0 references
Khovanov cohomology
0 references
Euler characteristic
0 references
0.8500595092773438
0 references
0.8455073833465576
0 references
0.8447134494781494
0 references
0.8403608202934265
0 references
0.8269214034080505
0 references
