REVIEW 1 cited by
A categorification for the chromatic polynomial
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A categorification for the chromatic polynomial
read the original 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.
Forward citations
Cited by 1 Pith paper
-
Categorification of some Penrose polynomials
Constructs doubly- and triply-graded Penrose-type homologies for ribbon graphs via TQFT cube of resolutions whose Euler characteristics recover Penrose polynomial specializations.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.