A categorification for the chromatic polynomial
组合数学
2014-10-01 v2 几何拓扑
摘要
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.
引用
@article{arxiv.math/0412264,
title = {A categorification for the chromatic polynomial},
author = {Laure Helme-Guizon and Yongwu Rong},
journal= {arXiv preprint arXiv:math/0412264},
year = {2014}
}
备注
Published by Algebraic and Geometric Topology at http://www.maths.warwick.ac.uk/agt/AGTVol5/agt-5-53.abs.html