A categorification for the chromatic polynomial (Q2571387): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56504776, #quickstatements; #temporary_batch_1710858552373 |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3106151143 / rank | |||
Normal rank | |||
Revision as of 20:08, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
