The chromatic polynomial of fatgraphs and its categorification

Details The chromatic polynomial of fatgraphs and its categorification The chromatic polynomial of fatgraphs and its categorification

2005-11-22

arxiv.org/abs/math/0511557v3

Adv. Math., 217 (2008) 1558-1587

Mathematics

Combinatorics

A substantial revision. To appear in Advances in Mathematics

Scientific paper

10.1016/j.aim.2007.11.016

Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane graphs, we show that our chromatic homology can be recovered from the Khovanov homology of an associated link. We apply this connection with Khovanov homology to show that the torsion-free part of our chromatic homology is independent of the choice of planar embedding of a graph. We extend our construction and categorify the Bollobas-Riordan polynomial (a generalisation of the Tutte polynomial to embedded graphs). We prove that both our chromatic homology and the Khovanov homology of an associated link can be recovered from this categorification.

Affiliated with

Also associated with

No associations

Rating

The chromatic polynomial of fatgraphs and its categorification does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The chromatic polynomial of fatgraphs and its categorification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The chromatic polynomial of fatgraphs and its categorification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-384377