A categorification for the chromatic polynomial (Q2571387): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56504776, #quickstatements; #temporary_batch_1710858552373
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3106151143 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0412264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Khovanov's categorification of the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knight move in chromatic cohomology / rank
 
Normal rank
Property / cites work
 
Property / cites work: A categorification of the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2869283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Torsion in graph homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: A categorification for the Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix factorizations and link homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix factorizations and link homology. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CATEGORIFICATION OF THE DICHROMATIC POLYNOMIAL FOR GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: New categorifications of the chromatic and dichromatic polynomials for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Khovanov homology, its definitions and ramifications / rank
 
Normal rank

Latest revision as of 09:05, 11 June 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
    0 references
    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

    Identifiers