Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Given a graph, we construct homology groups whose Euler characteristic is the Penrose polynomial of the graph, evaluated at an integer. This work is motivated by Khovanov's work on the categorification of the Jones polynomial for knots, and the subsequent categorifications of the chromatic and Tutte polynomials for graphs.