Reduced chromatic graph cohomology

Simple item page
dc.creatorChmutov, Michael
dc.creatorUdovina, Elena
dc.date2005-10-26
dc.date.accessioned2026-07-07T06:47:53Z
dc.date.available2026-07-07T06:47:53Z
dc.descriptionIn this paper we give a new characterization of the h-vector of the chromatic polynomial of a graph. We introduce reduced chromatic cohomology of a graph and show that h_i are its Betti numbers. We then discuss various combinatorial properties of these cohomologies. In particular we prove that these cohomologies depend only on the matroid type of the graph and describe their relationship to the regular chromatic cohomologies.
dc.description11 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/0510536
dc.identifierhttp://arxiv.org/abs/math/0510536
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/103804
dc.subjectCombinatorics
dc.subjectGeometric Topology
dc.subject05C15; 57M27
dc.titleReduced chromatic graph cohomology
dc.typetext

Files

Collections

arXiv