Chromatic Signed-Symmetric Functions of Signed Graphs
From MaRDI portal
Publication:6357846
arXiv2101.03018MaRDI QIDQ6357846FDOQ6357846
Authors: Masamichi Kuroda, Shuhei Tsujie 
Publication date: 8 January 2021
Abstract: Stanley introduced the chromatic symmetric function of a simple graph, which is a generalization of a chromatic polynomial. This is expressed in terms of the integer points of the complements of the corresponding graphic arrangement. Stanley proved a combinatorial reciprocity theorem for chromatic functions. This is considered as an Ehrhart-type reciprocity theorem for the graphic arrangement. We introduce the chromatic signed-symmetric function of a signed graph, an analogue of the chromatic symmetric function, by the integer points of the complements of the corresponding signed-graphic arrangement and prove a generalization of Stanley's reciprocity theorem. Stanley has conjectured that the chromatic symmetric function distinguishes trees. This conjecture is also generalized for signed trees. We verify the conjecture for certain classes of signed paths.
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
This page was built for publication: Chromatic Signed-Symmetric Functions of Signed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6357846)
