Affiliation:
1. Department of Combinatorics & Optimization University of Waterloo Waterloo Ontario Canada
Abstract
AbstractMany graph polynomials may be derived from the coefficients of the chromatic symmetric function of a graph when expressed in different bases. For instance, the chromatic polynomial is obtained by mapping for each in this function, while a polynomial whose coefficients enumerate acyclic orientations is obtained by mapping for each . In this paper, we study a new polynomial we call the tree polynomial arising by mapping , where is the chromatic symmetric function of a path with vertices. In particular, we show that this polynomial has a deletion‐contraction relation and has properties closely related to the chromatic polynomial while having coefficients that enumerate certain spanning trees and edge cutsets.
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference17 articles.
1. F.Aliniaeifard S. X.Li andS.vanWilligenburg Generalized chromatic functions arXiv preprint arXiv:2208.08458. (2022).
2. Extended chromatic symmetric functions and equality of ribbon Schur functions
3. Unit interval orders and the dot action on the cohomology of regular semisimple hessenberg varieties;Brosnan P.;Adv. Math,2018
4. Vassiliev knot invariants iii. forest algebra and weighted graphs;Chmutov S.;Adv. Soviet Math,1994
5. Chromatic bases for symmetric functions;Cho S.;Electr. J. Combin,2016