Hyperoctahedral Eulerian idempotents, Hodge decompositions, and signed graph coloring complexes

From MaRDI portal
Publication:405237

zbMATH Open1300.05091arXiv1307.7323MaRDI QIDQ405237FDOQ405237

Sarah Crown Rundell, Benjamin Braun

Publication date: 4 September 2014

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

Abstract: Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperoctahedral Eulerian idempotents.


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

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



Recommendations




Cites Work






This page was built for publication: Hyperoctahedral Eulerian idempotents, Hodge decompositions, and signed graph coloring complexes

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