|
Organizers |
An analog of Khovanov homology for Graphs
by
Laure Helme-Guizon
GWU
Coauthors: Yongwu Rong
This talk will explain how, from a graph, one can construct a chain complex whose graded Euler characteristic is the Chromatic polynomial of the graph we started from.
We will also describe an exact sequence which relates the homology groups of G, G-e and G/e, for any graph G and any edge e of G.
Date received: May 17, 2004
Copyright © 2004 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # canv-15.