A categorification for the signed chromatic polynomial

DOI10.37236/10939MaRDI QIDQ2152787zbMATH OpenOpenAlexFDO

Authors Zhiyun Cheng, Ziyi Lei, Yitian Wang, Yanguo Zhang

Publication date 11 July 2022

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2101.01661

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graded cohomology groupssigned graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Graph polynomials (05C31)

Abstract: By coloring a signed graph by signed colors, one obtains the signed chromatic polynomial of the signed graph. For each signed graph we construct graded cohomology groups whose graded Euler characteristic yields the signed chromatic polynomial of the signed graph. We show that the cohomology groups satisfy a long exact sequence which corresponds to signed deletion-contraction rule. This work is motivated by Helme-Guizon and Rong's construction of the categorification for the chromatic polynomial of unsigned graphs.

Review text

Summary: By coloring a signed graph by signed colors, one obtains the signed chromatic polynomial of the signed graph. For each signed graph we construct graded cohomology groups whose graded Euler characteristic yields the signed chromatic polynomial of the signed graph. We show that the cohomology groups satisfy a long exact sequence which categorifies the signed deletion-contraction rule. This work is motivated by Helme-Guizon and Rong's construction of the categorification for the chromatic polynomial of unsigned graphs [\textit{L. Helme-Guizon} and \textit{Y. Rong}, Algebr. Geom. Topol. 5, 1365--1388 (2005; Zbl 1081.05034)].

Recommendations

• A categorification for the chromatic polynomial
• A categorification of the chromatic symmetric polynomial
• New categorifications of the chromatic and dichromatic polynomials for graphs
• A categorification of the chromatic symmetric function
• A categorification for the Penrose polynomial

Cites work

• A categorification for the chromatic polynomial
• A categorification for the Penrose polynomial
• A categorification for the Tutte polynomial
• A categorification of the chromatic symmetric function
• A categorification of the Jones polynomial
• An introduction to chromatic polynomials
• Chromatic homology, Khovanov homology, and torsion
• Chromatic Polynomials
• Concepts of signed graph coloring
• Knight move in chromatic cohomology
• Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
• New categorifications of the chromatic and dichromatic polynomials for graphs
• On the coloring of signed graphs
• Region crossing change is an unknotting operation
• Signed graph coloring
• The chromatic number of a signed graph
• The chromatic polynomial of fatgraphs and its categorification
• The knight move conjecture is false
• Torsion in graph homology
• Torsion in Khovanov homology of semi-adequate links
• When is region crossing change an unknotting operation?
• When the theories meet: Khovanov homology as Hochschild homology of links

Cited in

(4)

• A categorification for the chromatic polynomial
• On polynomial representations of dual DP color functions
• Chromatic polynomials of signed graphs and dominating-vertex deletion formulae
• A categorification for the partial-dual genus polynomial

This page was built for publication: A categorification for the signed chromatic polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152787)